Daniel Lemire - RankMe

170 papers A* 3A 3B 1C 6Journal 137Unranked 18

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Converting Binary Floating-Point Numbers to Shortest Decimal Strings: An Experimental Review. CoRR Jaël Champagne Gareau, Daniel Lemire
2026	J	`jnl`	Converting Binary Floating-Point Numbers to Shortest Decimal Strings: An Experimental Review. Softw. Pract. Exp. Jaël Champagne Gareau, Daniel Lemire
2026	J	`jnl`	Fixing ill-formed UTF-16 strings with SIMD instructions. CoRR Robert Clausecker, Daniel Lemire
2025	J	`jnl`	Batched ranged random integer generation. Softw. Pract. Exp. Nevin Brackett-Rozinsky, Daniel Lemire
2025	—	`conf`	Enhancing Developer Productivity: Benchmarking LLM-Powered Tools like GitHub Copilot and TabNine in Real-Time Coding Environments. IDS Faten Slama, Daniel Lemire
2025	—	`conf`	Evaluating a GPT-4 and Retrieval-Augmented Generation-Based Conversational Agent to Enhance Learning Experience in a MOOC. CSEDU (2) Fatma Miladi, Valéry Psyché, Awa Diattara, Nour El Mawas, Daniel Lemire
2025	J	`jnl`	Faster Positional-Population Counts for AVX2, AVX-512, and ASIMD. Concurr. Comput. Pract. Exp. Robert Clausecker, Daniel Lemire, Florian Schintke
2025	J	`jnl`	Parsing Millions of DNS Records Per Second. Softw. Pract. Exp. Jeroen Koekkoek, Daniel Lemire
2025	J	`jnl`	Scanning HTML at Tens of Gigabytes Per Second on ARM Processors. Softw. Pract. Exp. Daniel Lemire
2025	J	`jnl`	Scanning HTML at Tens of Gigabytes per Second on ARM Processors. CoRR Daniel Lemire
2024	J	`jnl`	Batched Ranged Random Integer Generation. CoRR Nevin Brackett-Rozinsky, Daniel Lemire
2024	—	`conf`	Comparative Analysis of Loop-Free Function Evaluation Using ChatGPT and Copilot with C Bounded Model Checking. FLLM Faten Slama, Daniel Lemire
2024	—	`conf`	Comparative Performance of GPT-4, RAG-Augmented GPT-4, and Students in MOOCs. BBGI Fatma Miladi, Valéry Psyché, Daniel Lemire
2024	J	`jnl`	Exact Short Products From Truncated Multipliers. Comput. J. Daniel Lemire
2024	J	`jnl`	Faster Positional-Population Counts for AVX2, AVX-512, and ASIMD. CoRR Robert Clausecker, Daniel Lemire, Florian Schintke
2024	—	`conf`	Leveraging GPT-4 for Accuracy in Education: A Comparative Study on Retrieval-Augmented Generation in MOOCs. AIED Companion (1) Fatma Miladi, Valéry Psyché, Daniel Lemire
2024	J	`jnl`	On-demand JSON: A better way to parse documents? Softw. Pract. Exp. John Keiser, Daniel Lemire
2024	J	`jnl`	Parsing Millions of DNS Records per Second. CoRR Jeroen Koekkoek, Daniel Lemire
2024	J	`jnl`	Parsing millions of URLs per second. Softw. Pract. Exp. Yagiz Nizipli, Daniel Lemire
2024	J	`jnl`	Will AI Flood Us with Irrelevant Papers? Commun. ACM Daniel Lemire
2023	J	`jnl`	Exact Short Products From Truncated Multipliers. CoRR Daniel Lemire
2023	J	`jnl`	Fast number parsing without fallback. Softw. Pract. Exp. Noble Mushtak, Daniel Lemire
2023	B	`conf`	Learning Engagement and Peer Learning in MOOC: A Selective Systematic Review. ITS Fatma Miladi, Daniel Lemire, Valéry Psyché
2023	J	`jnl`	On-Demand JSON: A Better Way to Parse Documents? CoRR John Keiser, Daniel Lemire
2023	J	`jnl`	Parsing Millions of URLs per Second. CoRR Yagiz Nizipli, Daniel Lemire
2023	J	`jnl`	Transcoding unicode characters with AVX-512 instructions. Softw. Pract. Exp. Robert Clausecker, Daniel Lemire
2022	J	`jnl`	Binary Fuse Filters: Fast and Smaller Than Xor Filters. CoRR Thomas Mueller Graf, Daniel Lemire
2022	J	`jnl`	Binary Fuse Filters: Fast and Smaller Than Xor Filters. ACM J. Exp. Algorithmics Thomas Mueller Graf, Daniel Lemire
2022	J	`jnl`	Fast Number Parsing Without Fallback. CoRR Noble Mushtak, Daniel Lemire
2022	J	`jnl`	Transcoding Unicode Characters with AVX-512 Instructions. CoRR Robert Clausecker, Daniel Lemire
2022	J	`jnl`	Transcoding billions of Unicode characters per second with SIMD instructions. Softw. Pract. Exp. Daniel Lemire, Wojciech Mula
2021	J	`jnl`	Efficient computation of positional population counts using SIMD instructions. Concurr. Comput. Pract. Exp. Marcus D. R. Klarqvist, Wojciech Mula, Daniel Lemire
2021	J	`jnl`	Number Parsing at a Gigabyte per Second. CoRR Daniel Lemire
2021	J	`jnl`	Number parsing at a gigabyte per second. Softw. Pract. Exp. Daniel Lemire
2021	—	`conf`	SIMDGiraffe: Visualizing SIMD Functions. VISIGRAPP (3: IVAPP) Pierre-Marie Ntang, Daniel Lemire
2021	J	`jnl`	Transcoding Billions of Unicode Characters per Second with SIMD Instructions. CoRR Daniel Lemire, Wojciech Mula
2021	C	`conf`	Unicode at Gigabytes per Second. SPIRE Daniel Lemire
2021	J	`jnl`	Unicode at Gigabytes per Second. CoRR Daniel Lemire
2021	J	`jnl`	Validating UTF-8 in less than one instruction per byte. Softw. Pract. Exp. John Keiser, Daniel Lemire
2020	J	`jnl`	Base64 encoding and decoding at almost the speed of a memory copy. Softw. Pract. Exp. Wojciech Mula, Daniel Lemire
2020	J	`jnl`	Integer Division by Constants: Optimal Bounds. CoRR Daniel Lemire, Colin Bartlett, Owen Kaser
2020	J	`jnl`	Validating UTF-8 In Less Than One Instruction Per Byte. CoRR John Keiser, Daniel Lemire
2020	J	`jnl`	Xor Filters. ACM J. Exp. Algorithmics Thomas Mueller Graf, Daniel Lemire
2019	J	`jnl`	Base64 encoding and decoding at almost the speed of a memory copy. CoRR Wojciech Mula, Daniel Lemire
2019	—	`ed.`	Business Intelligence & Big Data, 15ème Edition de la conférence EDA, Montpellier, France, 3-4 octobre 2019. EDA Daniel Lemire, Lucile Sautot
2019	J	`jnl`	Efficient Computation of Positional Population Counts Using SIMD Instructions. CoRR Marcus D. R. Klarqvist, Wojciech Mula, Daniel Lemire
2019	J	`jnl`	Fast Random Integer Generation in an Interval. ACM Trans. Model. Comput. Simul. Daniel Lemire
2019	J	`jnl`	Faster Remainder by Direct Computation: Applications to Compilers and Software Libraries. CoRR Daniel Lemire, Owen Kaser, Nathan Kurz
2019	J	`jnl`	Faster remainder by direct computation: Applications to compilers and software libraries. Softw. Pract. Exp. Daniel Lemire, Owen Kaser, Nathan Kurz
2019	J	`jnl`	Parsing Gigabytes of JSON per Second. CoRR Geoff Langdale, Daniel Lemire
2019	J	`jnl`	Parsing gigabytes of JSON per second. VLDB J. Geoff Langdale, Daniel Lemire
2019	J	`jnl`	Xor Filters: Faster and Smaller Than Bloom and Cuckoo Filters. CoRR Thomas Mueller Graf, Daniel Lemire
2019	J	`jnl`	Xorshift1024*, xorshift1024+, xorshift128+ and xoroshiro128+ fail statistical tests for linearity. J. Comput. Appl. Math. Daniel Lemire, Melissa E. O'Neill
2018	—	`conf`	Apache Calcite: A Foundational Framework for Optimized Query Processing Over Heterogeneous Data Sources. SIGMOD Conference Edmon Begoli, Jesús Camacho-Rodríguez, Julian Hyde, Michael J. Mior, Daniel Lemire
2018	J	`jnl`	Apache Calcite: A Foundational Framework for Optimized Query Processing Over Heterogeneous Data Sources. CoRR Edmon Begoli, Jesús Camacho-Rodríguez, Julian Hyde, Michael J. Mior, Daniel Lemire
2018	J	`jnl`	Fast Random Integer Generation in an Interval. CoRR Daniel Lemire
2018	J	`jnl`	Faster Base64 Encoding and Decoding Using AVX2 Instructions. ACM Trans. Web Wojciech Mula, Daniel Lemire
2018	J	`jnl`	Faster Population Counts Using AVX2 Instructions. Comput. J. Wojciech Mula, Nathan Kurz, Daniel Lemire
2018	J	`jnl`	Full Solution Indexing for Top-K Web Service Composition. IEEE Trans. Serv. Comput. Jing Li, Yuhong Yan, Daniel Lemire
2018	J	`jnl`	On Desirable Semantics of Functional Dependencies over Databases with Incomplete Information. Fundam. Informaticae Antonio Badia, Daniel Lemire
2018	J	`jnl`	Roaring bitmaps: Implementation of an optimized software library. Softw. Pract. Exp. Daniel Lemire, Owen Kaser, Nathan Kurz, Luca Deri, Chris O'Hara, François Saint-Jacques, Gregory Ssi Yan Kai
2018	J	`jnl`	Stream VByte: Faster byte-oriented integer compression. Inf. Process. Lett. Daniel Lemire, Nathan Kurz, Christoph Rupp
2018	J	`jnl`	Xorshift1024*, Xorshift1024+, Xorshift128+ and Xoroshiro128+ Fail Statistical Tests for Linearity. CoRR Daniel Lemire, Melissa E. O'Neill
2017	—	`conf`	Discovering the smart forests with virtual reality. WIMS Dara Aghamirkarimi, Daniel Lemire
2017	J	`jnl`	Faster Base64 Encoding and Decoding Using AVX2 Instructions. CoRR Wojciech Mula, Daniel Lemire
2017	J	`jnl`	On Desirable Semantics of Functional Dependencies over Databases with Incomplete Information. CoRR Antonio Badia, Daniel Lemire
2017	J	`jnl`	Regular and almost universal hashing: an efficient implementation. Softw. Pract. Exp. Dmytro Ivanchykhin, Sergey Ignatchenko, Daniel Lemire
2017	J	`jnl`	Roaring Bitmaps: Implementation of an Optimized Software Library. CoRR Daniel Lemire, Owen Kaser, Nathan Kurz, Luca Deri, Chris O'Hara, François Saint-Jacques, Gregory Ssi Yan Kai
2017	J	`jnl`	Stream VByte: Faster Byte-Oriented Integer Compression. CoRR Daniel Lemire, Nathan Kurz, Christoph Rupp
2017	J	`jnl`	Upscaledb: Efficient integer-key compression in a key-value store using SIMD instructions. Inf. Syst. Daniel Lemire, Christoph Rupp
2016	J	`jnl`	Better bitmap performance with Roaring bitmaps. Softw. Pract. Exp. Samy Chambi, Daniel Lemire, Owen Kaser, Robert Godin
2016	J	`jnl`	Compressed bitmap indexes: beyond unions and intersections. Softw. Pract. Exp. Owen Kaser, Daniel Lemire
2016	J	`jnl`	Consistently faster and smaller compressed bitmaps with Roaring. CoRR Daniel Lemire, Gregory Ssi Yan Kai, Owen Kaser
2016	J	`jnl`	Consistently faster and smaller compressed bitmaps with Roaring. Softw. Pract. Exp. Daniel Lemire, Gregory Ssi Yan Kai, Owen Kaser
2016	J	`jnl`	Faster 64-bit universal hashing using carry-less multiplications. J. Cryptogr. Eng. Daniel Lemire, Owen Kaser
2016	J	`jnl`	Faster Population Counts using AVX2 Instructions. CoRR Wojciech Mula, Nathan Kurz, Daniel Lemire
2016	—	`conf`	Nouveaux modèles d'index bitmap compressés à 64 bits. EDA Samy Chambi, Daniel Lemire, Robert Godin
2016	C	`conf`	Optimizing Druid with Roaring bitmaps. IDEAS Samy Chambi, Daniel Lemire, Robert Godin, Kamel Boukhalfa, Charles R. Allen, Fangjin Yang
2016	J	`jnl`	Regular and almost universal hashing: an efficient implementation. CoRR Dmytro Ivanchykhin, Sergey Ignatchenko, Daniel Lemire
2016	J	`jnl`	SIMD compression and the intersection of sorted integers. Softw. Pract. Exp. Daniel Lemire, Leonid Boytsov, Nathan Kurz
2016	A	`conf`	Scaling Up Web Service Composition with the Skyline Operator. ICWS Jing Li, Yuhong Yan, Daniel Lemire
2016	J	`jnl`	Upscaledb: Efficient Integer-Key Compression in a Key-Value Store using SIMD Instructions. CoRR Daniel Lemire, Christoph Rupp
2016	J	`jnl`	Vers de meilleures performances avec des Roaring bitmaps. Tech. Sci. Informatiques Samy Chambi, Daniel Lemire, Robert Godin
2015	J	`jnl`	A General SIMD-Based Approach to Accelerating Compression Algorithms. ACM Trans. Inf. Syst. Wayne Xin Zhao, Xudong Zhang, Daniel Lemire, Dongdong Shan, Jian-Yun Nie, Hongfei Yan, Ji-Rong Wen
2015	J	`jnl`	A General SIMD-based Approach to Accelerating Compression Algorithms. CoRR Wayne Xin Zhao, Xudong Zhang, Daniel Lemire, Dongdong Shan, Jian-Yun Nie, Hongfei Yan, Ji-Rong Wen
2015	—	`conf`	A Web Service Composition Method Based on Compact K2-Trees. SCC Jing Li, Yuhong Yan, Daniel Lemire
2015	—	`conf`	An Analysis Tool for the Contextual Information from Field Experiments on Driving Fatigue. CONTEXT Perrine Ruer, Charles Gouin-Vallerand, Le Zhang, Daniel Lemire, Evelyne F. Vallières
2015	J	`jnl`	Bloofi: Multidimensional Bloom Filters. CoRR Adina Crainiceanu, Daniel Lemire
2015	J	`jnl`	Bloofi: Multidimensional Bloom filters. Inf. Syst. Adina Crainiceanu, Daniel Lemire
2015	J	`jnl`	Decoding billions of integers per second through vectorization. Softw. Pract. Exp. Daniel Lemire, Leonid Boytsov
2015	J	`jnl`	Faster 64-bit universal hashing using carry-less multiplications. CoRR Daniel Lemire, Owen Kaser
2015	J	`jnl`	Functional Dependencies with null Markers. Comput. J. Antonio Badia, Daniel Lemire
2015	J	`jnl`	Measuring academic influence: Not all citations are equal. CoRR Xiaodan Zhu, Peter D. Turney, Daniel Lemire, André Vellino
2015	J	`jnl`	Measuring academic influence: Not all citations are equal. J. Assoc. Inf. Sci. Technol. Xiaodan Zhu, Peter D. Turney, Daniel Lemire, André Vellino
2015	J	`jnl`	Vectorized VByte Decoding. CoRR Jeff Plaisance, Nathan Kurz, Daniel Lemire
2014	J	`jnl`	Better bitmap performance with Roaring bitmaps. CoRR Samy Chambi, Daniel Lemire, Owen Kaser, Robert Godin
2014	J	`jnl`	Compressed bitmap indexes: beyond unions and intersections. CoRR Owen Kaser, Daniel Lemire
2014	—	`conf`	Full Solution Indexing Using Database for QoS-Aware Web Service Composition. IEEE SCC Jing Li, Yuhong Yan, Daniel Lemire
2014	J	`jnl`	Functional dependencies with null markers. CoRR Antonio Badia, Daniel Lemire
2014	J	`jnl`	Introductory Editorial. Open J. Inf. Syst. Daniel Lemire
2014	—	`conf`	Roaring bitmap : nouveau modèle de compression bitmap. EDA Samy Chambi, Daniel Lemire, Robert Godin, Owen Kaser
2014	J	`jnl`	SIMD Compression and the Intersection of Sorted Integers. CoRR Daniel Lemire, Leonid Boytsov, Nathan Kurz
2014	J	`jnl`	Strongly Universal String Hashing is Fast. Comput. J. Daniel Lemire, Owen Kaser
2014	J	`jnl`	Threshold and Symmetric Functions over Bitmaps. CoRR Owen Kaser, Daniel Lemire
2013	J	`jnl`	Diamond dicing. Data Knowl. Eng. Hazel Webb, Daniel Lemire, Owen Kaser
2012	J	`jnl`	Changing computational research. The challenges ahead. Source Code Biol. Medicine Cameron Neylon, Jan Aerts, C. Titus Brown, Simon J. Coles, Les Hatton, Daniel Lemire, K. Jarrod Millman, Peter Murray-Rust, Fernando Pérez, Neil F. W. Saunders, Nigam Shah, Arfon M. Smith, Gaël Varoquaux, Egon L. Willighagen
2012	J	`jnl`	Decoding billions of integers per second through vectorization CoRR Daniel Lemire, Leonid Boytsov
2012	J	`jnl`	Reordering Rows for Better Compression: Beyond the Lexicographic Order CoRR Daniel Lemire, Owen Kaser, Eduardo Gutarra
2012	J	`jnl`	Reordering rows for better compression: Beyond the lexicographic order. ACM Trans. Database Syst. Daniel Lemire, Owen Kaser, Eduardo Gutarra
2012	J	`jnl`	Strongly universal string hashing is fast CoRR Owen Kaser, Daniel Lemire
2012	J	`jnl`	The universality of iterated hashing over variable-length strings. Discret. Appl. Math. Daniel Lemire
2012	J	`jnl`	Time series classification by class-specific Mahalanobis distance measures. Adv. Data Anal. Classif. Zoltán Prekopcsák, Daniel Lemire
2011	J	`jnl`	A Call to Arms: Revisiting Database Design CoRR Antonio Badia, Daniel Lemire
2011	J	`jnl`	A call to arms: revisiting database design. SIGMOD Rec. Antonio Badia, Daniel Lemire
2011	J	`jnl`	Extracting, Transforming and Archiving Scientific Data CoRR Daniel Lemire, André Vellino
2011	J	`jnl`	Reordering columns for smaller indexes. Inf. Sci. Daniel Lemire, Owen Kaser
2010	J	`jnl`	Evaluating Multidimensional Queries by Diamond Dicing CoRR Hazel Webb, Owen Kaser, Daniel Lemire
2010	J	`jnl`	Marketing your ideas: Don't sell yourself short. XRDS Daniel Lemire
2010	J	`jnl`	Recursive n-gram hashing is pairwise independent, at best. Comput. Speech Lang. Daniel Lemire, Owen Kaser
2010	J	`jnl`	Sorting improves word-aligned bitmap indexes. Data Knowl. Eng. Daniel Lemire, Owen Kaser, Kamel Aouiche
2010	J	`jnl`	The universality of iterated hashing over variable-length strings CoRR Daniel Lemire
2010	J	`jnl`	Time Series Classification by Class-Based Mahalanobis Distances CoRR Zoltán Prekopcsák, Daniel Lemire
2009	J	`jnl`	An optimal linear time algorithm for quasi-monotonic segmentation. Int. J. Comput. Math. Daniel Lemire, Martin Brooks, Yuhong Yan
2009	J	`jnl`	Faster retrieval with a two-pass dynamic-time-warping lower bound. Pattern Recognit. Daniel Lemire
2009	J	`jnl`	On the Challenges of Collaborative Data Processing CoRR Sylvie Noël, Daniel Lemire
2009	J	`jnl`	Reordering Columns for Smaller Indexes CoRR Daniel Lemire, Owen Kaser
2009	J	`jnl`	Sorting improves word-aligned bitmap indexes CoRR Daniel Lemire, Owen Kaser, Kamel Aouiche
2009	J	`jnl`	Web 2.0 OLAP: From Data Cubes to Tag Clouds CoRR Kamel Aouiche, Daniel Lemire, Robert Godin
2008	—	`conf`	Collaborative OLAP with Tag Clouds - Web 2.0 OLAP Formalism and Experimental Evaluation. WEBIST (1) Kamel Aouiche, Daniel Lemire, Robert Godin
2008	J	`jnl`	Faster Retrieval with a Two-Pass Dynamic-Time-Warping Lower Bound CoRR Daniel Lemire
2008	J	`jnl`	Faster Sequential Search with a Two-Pass Dynamic-Time-Warping Lower Bound CoRR Daniel Lemire
2008	J	`jnl`	Hierarchical bin buffering: Online local moments for dynamic external memory arrays. ACM Trans. Algorithms Daniel Lemire, Owen Kaser
2008	J	`jnl`	Histogram-Aware Sorting for Enhanced Word-Aligned Compression in Bitmap Indexes CoRR Owen Kaser, Daniel Lemire, Kamel Aouiche
2008	C	`conf`	Histogram-aware sorting for enhanced word-aligned compression in bitmap indexes. DOLAP Owen Kaser, Daniel Lemire, Kamel Aouiche
2008	J	`jnl`	Pruning Attribute Values From Data Cubes with Diamond Dicing CoRR Hazel Webb, Owen Kaser, Daniel Lemire
2008	C	`conf`	Pruning attribute values from data cubes with diamond dicing. IDEAS Hazel Webb, Owen Kaser, Daniel Lemire
2008	J	`jnl`	Tri de la table de faits et compression des index bitmaps avec alignement sur les mots CoRR Kamel Aouiche, Daniel Lemire, Owen Kaser
2008	—	`conf`	Web 2.0 OLAP: From Data Cubes to Tag Clouds. WEBIST (Selected Papers) Kamel Aouiche, Daniel Lemire, Robert Godin
2007	A	`conf`	A Better Alternative to Piecewise Linear Time Series Segmentation. SDM Daniel Lemire
2007	J	`jnl`	A Comparison of Five Probabilistic View-Size Estimation Techniques in OLAP CoRR Kamel Aouiche, Daniel Lemire
2007	C	`conf`	A comparison of five probabilistic view-size estimation techniques in OLAP. DOLAP Kamel Aouiche, Daniel Lemire
2007	J	`jnl`	An Optimal Linear Time Algorithm for Quasi-Monotonic Segmentation CoRR Daniel Lemire, Martin Brooks, Yuhong Yan
2007	J	`jnl`	An Optimal Linear Time Algorithm for Quasi-Monotonic Segmentation CoRR Daniel Lemire, Martin Brooks, Yuhong Yan
2007	J	`jnl`	Attribute Value Reordering For Efficient Hybrid OLAP CoRR Owen Kaser, Daniel Lemire
2007	J	`jnl`	Collaborative OLAP with Tag Clouds: Web 2.0 OLAP Formalism and Experimental Evaluation CoRR Kamel Aouiche, Daniel Lemire, Robert Godin
2007	J	`jnl`	Introduction to the Special Issue on Canadian Semantic Web. Comput. Intell. Mamadou Tadiou Kone, Daniel Lemire
2007	J	`jnl`	Recursive Hashing and One-Pass, One-Hash n-Gram Count Estimation CoRR Daniel Lemire, Owen Kaser
2007	J	`jnl`	Removing Manually-Generated Boilerplate from Electronic Texts: Experiments with Project Gutenberg e-Books CoRR Owen Kaser, Daniel Lemire
2007	—	`conf`	Removing manually generated boilerplate from electronic texts: experiments with project Gutenberg e-books. CASCON Owen Kaser, Daniel Lemire
2007	J	`jnl`	Slope One Predictors for Online Rating-Based Collaborative Filtering CoRR Daniel Lemire, Anna Maclachlan
2007	J	`jnl`	Tag-Cloud Drawing: Algorithms for Cloud Visualization CoRR Owen Kaser, Daniel Lemire
2007	—	`conf`	UNASSSUMING view-size estimation techniques in OLAP - an experimental comparison. ICEIS (1) Kamel Aouiche, Daniel Lemire
2007	J	`jnl`	Unasssuming View-Size Estimation Techniques in OLAP CoRR Kamel Aouiche, Daniel Lemire
2006	J	`jnl`	A Better Alternative to Piecewise Linear Time Series Segmentation CoRR Daniel Lemire
2006	J	`jnl`	Analyzing Large Collections of Electronic Text Using OLAP CoRR Steven Keith, Owen Kaser, Daniel Lemire
2006	J	`jnl`	Attribute value reordering for efficient hybrid OLAP. Inf. Sci. Owen Kaser, Daniel Lemire
2006	—	`ed.`	Canadian Semantic Web, CSWWS 2006, first Canadian Semantic Web Working Symposium, June 2006, Quebec, Canada CSWWS Mamadou Tadiou Kone, Daniel Lemire
2006	J	`jnl`	Hierarchical Bin Buffering: Online Local Moments for Dynamic External Memory Arrays CoRR Daniel Lemire, Owen Kaser
2006	J	`jnl`	One-Pass, One-Hash n-Gram Statistics Estimation CoRR Daniel Lemire, Owen Kaser
2006	J	`jnl`	Streaming Maximum-Minimum Filter Using No More than Three Comparisons per Element CoRR Daniel Lemire
2006	J	`jnl`	Streaming Maximum-Minimum Filter Using No More than Three Comparisons per Element. Nord. J. Comput. Daniel Lemire
2005	A*	`conf`	An Optimal Linear Time Algorithm for Quasi-Monotonic Segmentation. ICDM Daniel Lemire, Martin Brooks, Yuhong Yan
2005	J	`jnl`	Collaborative filtering and inference rules for context-aware learning object recommendation. Interact. Technol. Smart Educ. Daniel Lemire, Harold Boley, Sean McGrath, Marcel Ball
2005	A*	`conf`	Quasi-Monotonic Segmentation of State Variable Behavior for Reactive Control. AAAI Will Fitzgerald, Daniel Lemire, Martin Brooks
2005	J	`jnl`	Scale and Translation Invariant Collaborative Filtering Systems. Inf. Retr. Daniel Lemire
2005	A*	`conf`	Scale-Based Monotonicity Analysis in Qualitative Modelling with Flat Segments. IJCAI Martin Brooks, Yuhong Yan, Daniel Lemire
2005	A	`conf`	Slope One Predictors for Online Rating-Based Collaborative Filtering. SDM Daniel Lemire, Anna Maclachlan
2003	C	`conf`	Attribute value reordering for efficient hybrid OLAP. DOLAP Owen Kaser, Daniel Lemire
2002	—	`conf`	Wavelet-based relative prefix sum methods for range sum queries in data cubes. CASCON Daniel Lemire
2000	J	`jnl`	Wavelet time entropy, T wave morphology and myocardial ischemia. IEEE Trans. Biomed. Eng. Daniel Lemire, Chantal Pharand, Jean-Claude Rajaonah, Bruno Dubé, A.-Robert LeBlanc