| 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 Perez, 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 (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) | |
| 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 Transactions on Algorithms 4(1) (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 (Eds.): 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 | |
| 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 | |
| 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) | |
Colors in the list of coauthors
Last update Thu May 23 08:36:55 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page