Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarDaniel Lemire
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
showing all ?? records
2010 – today
- 2018
[j35]Daniel Lemire, Nathan Kurz, Christoph Rupp:
Stream VByte: Faster byte-oriented integer compression. Inf. Process. Lett. 130: 1-6 (2018)- 2017
- [j34]Daniel Lemire, Christoph Rupp:
Upscaledb: Efficient integer-key compression in a key-value store using SIMD instructions. Inf. Syst. 66: 13-23 (2017) - [j33]Dmytro Ivanchykhin, Sergey Ignatchenko, Daniel Lemire:
Regular and almost universal hashing: an efficient implementation. Softw., Pract. Exper. 47(10): 1299-1323 (2017) - [c22]Dara Aghamirkarimi, Daniel Lemire:
Discovering the smart forests with virtual reality. WIMS 2017: 31:1-31:6 - [i50]Antonio Badia, Daniel Lemire:
On Desirable Semantics of Functional Dependencies over Databases with Incomplete Information. CoRR abs/1703.08198 (2017) - [i49]Wojciech Mula, Daniel Lemire:
Faster Base64 Encoding and Decoding Using AVX2 Instructions. CoRR abs/1704.00605 (2017) - [i48]Daniel Lemire, Owen Kaser, Nathan Kurz, Luca Deri, Chris O'Hara, François Saint-Jacques, Gregory Ssi Yan Kai:
Roaring Bitmaps: Implementation of an Optimized Software Library. CoRR abs/1709.07821 (2017) - [i47]Daniel Lemire, Nathan Kurz, Christoph Rupp:
Stream VByte: Faster Byte-Oriented Integer Compression. CoRR abs/1709.08990 (2017) - 2016
- [j32]Daniel Lemire, Owen Kaser:
Faster 64-bit universal hashing using carry-less multiplications. J. Cryptographic Engineering 6(3): 171-185 (2016) - [j31]Owen Kaser, Daniel Lemire:
Compressed bitmap indexes: beyond unions and intersections. Softw., Pract. Exper. 46(2): 167-198 (2016) - [j30]Samy Chambi, Daniel Lemire, Owen Kaser, Robert Godin:
Better bitmap performance with Roaring bitmaps. Softw., Pract. Exper. 46(5): 709-719 (2016) - [j29]Daniel Lemire, Leonid Boytsov, Nathan Kurz:
SIMD compression and the intersection of sorted integers. Softw., Pract. Exper. 46(6): 723-749 (2016) - [j28]Daniel Lemire, Gregory Ssi Yan Kai, Owen Kaser:
Consistently faster and smaller compressed bitmaps with Roaring. Softw., Pract. Exper. 46(11): 1547-1569 (2016) - [j27]Samy Chambi, Daniel Lemire, Robert Godin:
Vers de meilleures performances avec des Roaring bitmaps. Technique et Science Informatiques 35(3): 335-355 (2016) - [c21]Samy Chambi, Daniel Lemire, Robert Godin:
Nouveaux modèles d’index bitmap compressés à 64 bits. EDA 2016: 1-16 - [c20]Jing Li, Yuhong Yan, Daniel Lemire:
Scaling Up Web Service Composition with the Skyline Operator. ICWS 2016: 147-154 - [c19]Samy Chambi, Daniel Lemire, Robert Godin, Kamel Boukhalfa, Charles R. Allen, Fangjin Yang:
Optimizing Druid with Roaring bitmaps. IDEAS 2016: 77-86 - [i46]Daniel Lemire, Gregory Ssi Yan Kai, Owen Kaser:
Consistently faster and smaller compressed bitmaps with Roaring. CoRR abs/1603.06549 (2016) - [i45]Dmytro Ivanchykhin, Sergey Ignatchenko, Daniel Lemire:
Regular and almost universal hashing: an efficient implementation. CoRR abs/1609.09840 (2016) - [i44]Daniel Lemire, Christoph Rupp:
Upscaledb: Efficient Integer-Key Compression in a Key-Value Store using SIMD Instructions. CoRR abs/1611.05428 (2016) - [i43]Wojciech Mula, Nathan Kurz, Daniel Lemire:
Faster Population Counts using AVX2 Instructions. CoRR abs/1611.07612 (2016) - 2015
- [j26]Antonio Badia, Daniel Lemire:
Functional Dependencies with null Markers. Comput. J. 58(5): 1160-1168 (2015) - [j25]Adina Crainiceanu, Daniel Lemire:
Bloofi: Multidimensional Bloom filters. Inf. Syst. 54: 311-324 (2015) - [j24]Xiaodan Zhu, Peter D. Turney, Daniel Lemire, André Vellino:
Measuring academic influence: Not all citations are equal. JASIST 66(2): 408-427 (2015) - [j23]Daniel Lemire, Leonid Boytsov:
Decoding billions of integers per second through vectorization. Softw., Pract. Exper. 45(1): 1-29 (2015) - [j22]Wayne Xin Zhao, Xudong Zhang, Daniel Lemire, Dongdong Shan, Jian-Yun Nie, Hongfei Yan, Ji-Rong Wen:
A General SIMD-Based Approach to Accelerating Compression Algorithms. ACM Trans. Inf. Syst. 33(3): 15:1-15:28 (2015) - [c18]Jing Li, Yuhong Yan, Daniel Lemire:
A Web Service Composition Method Based on Compact K2-Trees. SCC 2015: 403-410 - [c17]Perrine Ruer, Charles Gouin-Vallerand, Le Zhang, Daniel Lemire, Evelyne F. Vallières:
An Analysis Tool for the Contextual Information from Field Experiments on Driving Fatigue. CONTEXT 2015: 172-185 - [i42]Adina Crainiceanu, Daniel Lemire:
Bloofi: Multidimensional Bloom Filters. CoRR abs/1501.01941 (2015) - [i41]Xiaodan Zhu, Peter D. Turney, Daniel Lemire, André Vellino:
Measuring academic influence: Not all citations are equal. CoRR abs/1501.06587 (2015) - [i40]Wayne Xin Zhao, Xudong Zhang, Daniel Lemire, Dongdong Shan, Jian-Yun Nie, Hongfei Yan, Ji-Rong Wen:
A General SIMD-based Approach to Accelerating Compression Algorithms. CoRR abs/1502.01916 (2015) - [i39]Daniel Lemire, Owen Kaser:
Faster 64-bit universal hashing using carry-less multiplications. CoRR abs/1503.03465 (2015) - [i38]
- 2014
- [j21]Daniel Lemire, Owen Kaser:
Strongly Universal String Hashing is Fast. Comput. J. 57(11): 1624-1638 (2014) - [j20]
- [c16]Jing Li, Yuhong Yan, Daniel Lemire:
Full Solution Indexing Using Database for QoS-Aware Web Service Composition. IEEE SCC 2014: 99-106 - [c15]Samy Chambi, Daniel Lemire, Robert Godin, Owen Kaser:
Roaring bitmap : nouveau modèle de compression bitmap. EDA 2014: 37-50 - [i37]Daniel Lemire, Leonid Boytsov, Nathan Kurz:
SIMD Compression and the Intersection of Sorted Integers. CoRR abs/1401.6399 (2014) - [i36]Owen Kaser, Daniel Lemire:
Threshold and Symmetric Functions over Bitmaps. CoRR abs/1402.4073 (2014) - [i35]Owen Kaser, Daniel Lemire:
Compressed bitmap indexes: beyond unions and intersections. CoRR abs/1402.4466 (2014) - [i34]Samy Chambi, Daniel Lemire, Owen Kaser, Robert Godin:
Better bitmap performance with Roaring bitmaps. CoRR abs/1402.6407 (2014) - [i33]
- 2013
- [j19]
- 2012
- [j18]Zoltán Prekopcsák, Daniel Lemire:
Time series classification by class-specific Mahalanobis distance measures. Adv. Data Analysis and Classification 6(3): 185-200 (2012) - [j17]Daniel Lemire:
The universality of iterated hashing over variable-length strings. Discrete Applied Mathematics 160(4-5): 604-617 (2012) - [j16]Cameron Neylon, Jan Aerts, C. Brown, Simon J. Coles, Les Hatton, Daniel Lemire, K. Millman, Peter Murray-Rust, Fernando Pérez, Neil F. W. Saunders, Nigam Shah, Arfon Smith, Gaël Varoquaux, Egon L. Willighagen:
Changing computational research. The challenges ahead. Source Code for Biology and Medicine 7: 2 (2012) - [j15]Daniel Lemire, Owen Kaser, Eduardo Gutarra:
Reordering rows for better compression: Beyond the lexicographic order. ACM Trans. Database Syst. 37(3): 20:1-20:29 (2012) - [i32]
- [i31]Daniel Lemire, Owen Kaser, Eduardo Gutarra:
Reordering Rows for Better Compression: Beyond the Lexicographic Order. CoRR abs/1207.2189 (2012) - [i30]Daniel Lemire, Leonid Boytsov:
Decoding billions of integers per second through vectorization. CoRR abs/1209.2137 (2012) - 2011
- [j14]Daniel Lemire, Owen Kaser:
Reordering columns for smaller indexes. Inf. Sci. 181(12): 2550-2570 (2011) - [j13]Antonio Badia, Daniel Lemire:
A call to arms: revisiting database design. SIGMOD Record 40(3): 61-69 (2011) - [i29]
- [i28]Daniel Lemire, André Vellino:
Extracting, Transforming and Archiving Scientific Data. CoRR abs/1108.4041 (2011) - 2010
- [j12]
- [j11]Daniel Lemire, Owen Kaser:
Recursive n-gram hashing is pairwise independent, at best. Computer Speech & Language 24(4): 698-710 (2010) - [j10]Daniel Lemire, Owen Kaser, Kamel Aouiche:
Sorting improves word-aligned bitmap indexes. Data Knowl. Eng. 69(1): 3-28 (2010) - [i27]Hazel Webb, Owen Kaser, Daniel Lemire:
Evaluating Multidimensional Queries by Diamond Dicing. CoRR abs/1006.3726 (2010) - [i26]Daniel Lemire:
The universality of iterated hashing over variable-length strings. CoRR abs/1008.1715 (2010) - [i25]Zoltán Prekopcsák, Daniel Lemire:
Time Series Classification by Class-Based Mahalanobis Distances. CoRR abs/1010.1526 (2010)
2000 – 2009
- 2009
- [j9]Daniel Lemire, Martin Brooks, Yuhong Yan:
An optimal linear time algorithm for quasi-monotonic segmentation. Int. J. Comput. Math. 86(7): 1093-1104 (2009) - [j8]Daniel Lemire:
Faster retrieval with a two-pass dynamic-time-warping lower bound. Pattern Recognition 42(9): 2169-2180 (2009) - [i24]Daniel Lemire, Owen Kaser, Kamel Aouiche:
Sorting improves word-aligned bitmap indexes. CoRR abs/0901.3751 (2009) - [i23]Kamel Aouiche, Daniel Lemire, Robert Godin:
Web 2.0 OLAP: From Data Cubes to Tag Clouds. CoRR abs/0905.2657 (2009) - [i22]Sylvie Noël, Daniel Lemire:
On the Challenges of Collaborative Data Processing. CoRR abs/0906.0910 (2009) - [i21]
- 2008
- [j7]Daniel Lemire, Owen Kaser:
Hierarchical bin buffering: Online local moments for dynamic external memory arrays. ACM Trans. Algorithms 4(1): 14:1-14:31 (2008) - [c14]Owen Kaser, Daniel Lemire, Kamel Aouiche:
Histogram-aware sorting for enhanced word-aligned compression in bitmap indexes. DOLAP 2008: 1-8 - [c13]Hazel Webb, Owen Kaser, Daniel Lemire:
Pruning attribute values from data cubes with diamond dicing. IDEAS 2008: 121-129 - [c12]Kamel Aouiche, Daniel Lemire, Robert Godin:
Collaborative OLAP with Tag Clouds - Web 2.0 OLAP Formalism and Experimental Evaluation. WEBIST (1) 2008: 5-12 - [c11]Kamel Aouiche, Daniel Lemire, Robert Godin:
Web 2.0 OLAP: From Data Cubes to Tag Clouds. WEBIST (Selected Papers) 2008: 51-64 - [i20]Hazel Webb, Owen Kaser, Daniel Lemire:
Pruning Attribute Values From Data Cubes with Diamond Dicing. CoRR abs/0805.0747 (2008) - [i19]Kamel Aouiche, Daniel Lemire, Owen Kaser:
Tri de la table de faits et compression des index bitmaps avec alignement sur les mots. CoRR abs/0805.3339 (2008) - [i18]Daniel Lemire:
Faster Sequential Search with a Two-Pass Dynamic-Time-Warping Lower Bound. CoRR abs/0807.1734 (2008) - [i17]Owen Kaser, Daniel Lemire, Kamel Aouiche:
Histogram-Aware Sorting for Enhanced Word-Aligned Compression in Bitmap Indexes. CoRR abs/0808.2083 (2008) - [i16]Daniel Lemire:
Faster Retrieval with a Two-Pass Dynamic-Time-Warping Lower Bound. CoRR abs/0811.3301 (2008) - 2007
- [j6]Mamadou Tadiou Kone, Daniel Lemire:
Introduction to the Special Issue on Canadian Semantic Web. Computational Intelligence 23(3): 299-301 (2007) - [c10]Owen Kaser, Daniel Lemire:
Removing manually generated boilerplate from electronic texts: experiments with project Gutenberg e-books. CASCON 2007: 272-275 - [c9]Kamel Aouiche, Daniel Lemire:
A comparison of five probabilistic view-size estimation techniques in OLAP. DOLAP 2007: 17-24 - [c8]Kamel Aouiche, Daniel Lemire:
UNASSSUMING view-size estimation techniques in OLAP - an experimental comparison. ICEIS (1) 2007: 145-150 - [c7]
- [i15]Daniel Lemire, Owen Kaser:
Recursive Hashing and One-Pass, One-Hash n-Gram Count Estimation. CoRR abs/0705.4676 (2007) - [i14]Owen Kaser, Daniel Lemire:
Removing Manually-Generated Boilerplate from Electronic Texts: Experiments with Project Gutenberg e-Books. CoRR abs/0707.1913 (2007) - [i13]Daniel Lemire, Martin Brooks, Yuhong Yan:
An Optimal Linear Time Algorithm for Quasi-Monotonic Segmentation. CoRR abs/0709.1166 (2007) - [i12]Kamel Aouiche, Daniel Lemire, Robert Godin:
Collaborative OLAP with Tag Clouds: Web 2.0 OLAP Formalism and Experimental Evaluation. CoRR abs/0710.2156 (2007) - [i11]Daniel Lemire, Martin Brooks, Yuhong Yan:
An Optimal Linear Time Algorithm for Quasi-Monotonic Segmentation. CoRR abs/cs/0702142 (2007) - [i10]Owen Kaser, Daniel Lemire:
Attribute Value Reordering For Efficient Hybrid OLAP. CoRR abs/cs/0702143 (2007) - [i9]Daniel Lemire, Anna Maclachlan:
Slope One Predictors for Online Rating-Based Collaborative Filtering. CoRR abs/cs/0702144 (2007) - [i8]Kamel Aouiche, Daniel Lemire:
Unasssuming View-Size Estimation Techniques in OLAP. CoRR abs/cs/0703056 (2007) - [i7]Kamel Aouiche, Daniel Lemire:
A Comparison of Five Probabilistic View-Size Estimation Techniques in OLAP. CoRR abs/cs/0703058 (2007) - [i6]Owen Kaser, Daniel Lemire:
Tag-Cloud Drawing: Algorithms for Cloud Visualization. CoRR abs/cs/0703109 (2007) - 2006
- [j5]Owen Kaser, Daniel Lemire:
Attribute value reordering for efficient hybrid OLAP. Inf. Sci. 176(16): 2304-2336 (2006) - [j4]Daniel Lemire:
Streaming Maximum-Minimum Filter Using No More than Three Comparisons per Element. Nord. J. Comput. 13(4): 328-339 (2006) - [e1]Mamadou Tadiou Kone, Daniel Lemire:
Canadian Semantic Web, CSWWS 2006, first Canadian Semantic Web Working Symposium, June 2006, Quebec, Canada. Semantic Web and Beyond: Computing for Human Experience 2, Springer 2006, ISBN 978-0-387-29815-3 [contents] - [i5]Daniel Lemire:
A Better Alternative to Piecewise Linear Time Series Segmentation. CoRR abs/cs/0605103 (2006) - [i4]Steven Keith, Owen Kaser, Daniel Lemire:
Analyzing Large Collections of Electronic Text Using OLAP. CoRR abs/cs/0605127 (2006) - [i3]Daniel Lemire, Owen Kaser:
One-Pass, One-Hash n-Gram Statistics Estimation. CoRR abs/cs/0610010 (2006) - [i2]Daniel Lemire:
Streaming Maximum-Minimum Filter Using No More than Three Comparisons per Element. CoRR abs/cs/0610046 (2006) - [i1]Daniel Lemire, Owen Kaser:
Hierarchical Bin Buffering: Online Local Moments for Dynamic External Memory Arrays. CoRR abs/cs/0610128 (2006) - 2005
- [j3]Daniel Lemire:
Scale and Translation Invariant Collaborative Filtering Systems. Inf. Retr. 8(1): 129-150 (2005) - [j2]Daniel Lemire, Harold Boley, Sean McGrath, Marcel Ball:
Collaborative filtering and inference rules for context-aware learning object recommendation. Interact. Techn. Smart Edu. 2(3): 179-188 (2005) - [c6]Will Fitzgerald, Daniel Lemire, Martin Brooks:
Quasi-Monotonic Segmentation of State Variable Behavior for Reactive Control. AAAI 2005: 1145-1150 - [c5]Daniel Lemire, Martin Brooks, Yuhong Yan:
An Optimal Linear Time Algorithm for Quasi-Monotonic Segmentation. ICDM 2005: 709-712 - [c4]Martin Brooks, Yuhong Yan, Daniel Lemire:
Scale-Based Monotonicity Analysis in Qualitative Modelling with Flat Segments. IJCAI 2005: 400-405 - [c3]Daniel Lemire, Anna Maclachlan:
Slope One Predictors for Online Rating-Based Collaborative Filtering. SDM 2005: 471-475 - 2003
- [c2]
- 2002
- [c1]Daniel Lemire:
Wavelet-based relative prefix sum methods for range sum queries in data cubes. CASCON 2002: 6 - 2000
- [j1]Daniel Lemire, Chantal Pharand, Jean-Claude Rajaonah, Bruno Dubé, A.-Robert LeBlanc:
Wavelet time entropy, T wave morphology and myocardial ischemia. IEEE Trans. Biomed. Engineering 47(7): 967-970 (2000)
Coauthor Index
maintained by 
at 
at 
data released under the ODC-BY 1.0 license; see also our legal information page
last updated on 2018-01-04 20:31 CET by the dblp team