 | 2012 |
|---|
| 59 |       | Owen Kaser,
Daniel Lemire:
Strongly universal string hashing is fast
CoRR abs/1202.4961: (2012) |
| 58 | | Daniel Lemire:
The universality of iterated hashing over variable-length strings.
Discrete Applied Mathematics 160(4-5): 604-617 (2012) |
| 2011 |
|---|
| 57 | | Antonio Badia,
Daniel Lemire:
A Call to Arms: Revisiting Database Design
CoRR abs/1105.6001: (2011) |
| 56 | | Daniel Lemire,
André Vellino:
Extracting, Transforming and Archiving Scientific Data
CoRR abs/1108.4041: (2011) |
| 55 | | Daniel Lemire,
Owen Kaser:
Reordering columns for smaller indexes.
Inf. Sci. 181(12): 2550-2570 (2011) |
| 54 | | Antonio Badia,
Daniel Lemire:
A call to arms: revisiting database design.
SIGMOD Record 40(3): 61-69 (2011) |
| 2010 |
|---|
| 53 | | Daniel Lemire:
Marketing your ideas: Don't sell yourself short.
ACM Crossroads 16(4): 7 (2010) |
| 52 | | Hazel Webb,
Owen Kaser,
Daniel Lemire:
Evaluating Multidimensional Queries by Diamond Dicing
CoRR abs/1006.3726: (2010) |
| 51 | | Daniel Lemire:
The universality of iterated hashing over variable-length strings
CoRR abs/1008.1715: (2010) |
| 50 | | Zoltán Prekopcsák,
Daniel Lemire:
Time Series Classification by Class-Based Mahalanobis Distances
CoRR abs/1010.1526: (2010) |
| 49 | | Daniel Lemire,
Owen Kaser:
Recursive n-gram hashing is pairwise independent, at best.
Computer Speech & Language 24(4): 698-710 (2010) |
| 48 | | Daniel Lemire,
Owen Kaser,
Kamel Aouiche:
Sorting improves word-aligned bitmap indexes.
Data Knowl. Eng. 69(1): 3-28 (2010) |
| 2009 |
|---|
| 47 | | Daniel Lemire,
Owen Kaser,
Kamel Aouiche:
Sorting improves word-aligned bitmap indexes
CoRR abs/0901.3751: (2009) |
| 46 | | Kamel Aouiche,
Daniel Lemire,
Robert Godin:
Web 2.0 OLAP: From Data Cubes to Tag Clouds
CoRR abs/0905.2657: (2009) |
| 45 | | Sylvie Noël,
Daniel Lemire:
On the Challenges of Collaborative Data Processing
CoRR abs/0906.0910: (2009) |
| 44 | | Daniel Lemire,
Owen Kaser:
Reordering Columns for Smaller Indexes
CoRR abs/0909.1346: (2009) |
| 43 | | Daniel Lemire,
Martin Brooks,
Yuhong Yan:
An optimal linear time algorithm for quasi-monotonic segmentation.
Int. J. Comput. Math. 86(7): 1093-1104 (2009) |
| 42 | | Daniel Lemire:
Faster retrieval with a two-pass dynamic-time-warping lower bound.
Pattern Recognition 42(9): 2169-2180 (2009) |
| 2008 |
|---|
| 41 | | Owen Kaser,
Daniel Lemire,
Kamel Aouiche:
Histogram-aware sorting for enhanced word-aligned compression in bitmap indexes.
DOLAP 2008: 1-8 |
| 40 | | Hazel Webb,
Owen Kaser,
Daniel Lemire:
Pruning attribute values from data cubes with diamond dicing.
IDEAS 2008: 121-129 |
| 39 |  | Kamel Aouiche,
Daniel Lemire,
Robert Godin:
Collaborative OLAP with Tag Clouds - Web 2.0 OLAP Formalism and Experimental Evaluation.
WEBIST (1) 2008: 5-12 |
| 38 | | Kamel Aouiche,
Daniel Lemire,
Robert Godin:
Web 2.0 OLAP: From Data Cubes to Tag Clouds.
WEBIST (Selected Papers) 2008: 51-64 |
| 37 | | Daniel Lemire,
Owen Kaser:
Hierarchical bin buffering: Online local moments for dynamic external memory arrays.
ACM Transactions on Algorithms 4(1): (2008) |
| 36 | | Hazel Webb,
Owen Kaser,
Daniel Lemire:
Pruning Attribute Values From Data Cubes with Diamond Dicing
CoRR abs/0805.0747: (2008) |
| 35 | | 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) |
| 34 | | Daniel Lemire:
Faster Sequential Search with a Two-Pass Dynamic-Time-Warping Lower Bound
CoRR abs/0807.1734: (2008) |
| 33 | | Owen Kaser,
Daniel Lemire,
Kamel Aouiche:
Histogram-Aware Sorting for Enhanced Word-Aligned Compression in Bitmap Indexes
CoRR abs/0808.2083: (2008) |
| 32 | | Daniel Lemire:
Faster Retrieval with a Two-Pass Dynamic-Time-Warping Lower Bound
CoRR abs/0811.3301: (2008) |
| 2007 |
|---|
| 31 | | Owen Kaser,
Daniel Lemire:
Removing manually generated boilerplate from electronic texts: experiments with project Gutenberg e-books.
CASCON 2007: 272-275 |
| 30 | | Kamel Aouiche,
Daniel Lemire:
A comparison of five probabilistic view-size estimation techniques in OLAP.
DOLAP 2007: 17-24 |
| 29 | | Kamel Aouiche,
Daniel Lemire:
UNASSSUMING view-size estimation techniques in OLAP - an experimental comparison.
ICEIS (1) 2007: 145-150 |
| 28 | | Daniel Lemire:
A Better Alternative to Piecewise Linear Time Series Segmentation.
SDM 2007 |
| 27 | | Daniel Lemire,
Owen Kaser:
Recursive Hashing and One-Pass, One-Hash n-Gram Count Estimation
CoRR abs/0705.4676: (2007) |
| 26 | | Owen Kaser,
Daniel Lemire:
Removing Manually-Generated Boilerplate from Electronic Texts: Experiments with Project Gutenberg e-Books
CoRR abs/0707.1913: (2007) |
| 25 | | Daniel Lemire,
Martin Brooks,
Yuhong Yan:
An Optimal Linear Time Algorithm for Quasi-Monotonic Segmentation
CoRR abs/0709.1166: (2007) |
| 24 | | Kamel Aouiche,
Daniel Lemire,
Robert Godin:
Collaborative OLAP with Tag Clouds: Web 2.0 OLAP Formalism and Experimental Evaluation
CoRR abs/0710.2156: (2007) |
| 23 | | Daniel Lemire,
Martin Brooks,
Yuhong Yan:
An Optimal Linear Time Algorithm for Quasi-Monotonic Segmentation
CoRR abs/cs/0702142: (2007) |
| 22 | | Owen Kaser,
Daniel Lemire:
Attribute Value Reordering For Efficient Hybrid OLAP
CoRR abs/cs/0702143: (2007) |
| 21 | | Daniel Lemire,
Anna Maclachlan:
Slope One Predictors for Online Rating-Based Collaborative Filtering
CoRR abs/cs/0702144: (2007) |
| 20 | | Kamel Aouiche,
Daniel Lemire:
Unasssuming View-Size Estimation Techniques in OLAP
CoRR abs/cs/0703056: (2007) |
| 19 | | Kamel Aouiche,
Daniel Lemire:
A Comparison of Five Probabilistic View-Size Estimation Techniques in OLAP
CoRR abs/cs/0703058: (2007) |
| 18 | | Owen Kaser,
Daniel Lemire:
Tag-Cloud Drawing: Algorithms for Cloud Visualization
CoRR abs/cs/0703109: (2007) |
| 17 | | Mamadou Tadiou Kone,
Daniel Lemire:
Introduction to the Special Issue on Canadian Semantic Web.
Computational Intelligence 23(3): 299-301 (2007) |
| 2006 |
|---|
| 16 | | Mamadou Tadiou Kone,
Daniel Lemire:
Canadian Semantic Web, CSWWS 2006, first Canadian Semantic Web Working Symposium, June 2006, Quebec, Canada
Springer 2006 |
| 15 | | Daniel Lemire:
A Better Alternative to Piecewise Linear Time Series Segmentation
CoRR abs/cs/0605103: (2006) |
| 14 | | Steven Keith,
Owen Kaser,
Daniel Lemire:
Analyzing Large Collections of Electronic Text Using OLAP
CoRR abs/cs/0605127: (2006) |
| 13 | | Daniel Lemire,
Owen Kaser:
One-Pass, One-Hash n-Gram Statistics Estimation
CoRR abs/cs/0610010: (2006) |
| 12 | | Daniel Lemire:
Streaming Maximum-Minimum Filter Using No More than Three Comparisons per Element
CoRR abs/cs/0610046: (2006) |
| 11 | | Daniel Lemire,
Owen Kaser:
Hierarchical Bin Buffering: Online Local Moments for Dynamic External Memory Arrays
CoRR abs/cs/0610128: (2006) |
| 10 | | Owen Kaser,
Daniel Lemire:
Attribute value reordering for efficient hybrid OLAP.
Inf. Sci. 176(16): 2304-2336 (2006) |
| 9 | | Daniel Lemire:
Streaming Maximum-Minimum Filter Using No More than Three Comparisons per Element.
Nord. J. Comput. 13(4): 328-339 (2006) |
| 2005 |
|---|
| 8 | | Will Fitzgerald,
Daniel Lemire,
Martin Brooks:
Quasi-Monotonic Segmentation of State Variable Behavior for Reactive Control.
AAAI 2005: 1145-1150 |
| 7 | | Daniel Lemire,
Martin Brooks,
Yuhong Yan:
An Optimal Linear Time Algorithm for Quasi-Monotonic Segmentation.
ICDM 2005: 709-712 |
| 6 | | Martin Brooks,
Yuhong Yan,
Daniel Lemire:
Scale-Based Monotonicity Analysis in Qualitative Modelling with Flat Segments.
IJCAI 2005: 400-405 |
| 5 | | Daniel Lemire,
Anna Maclachlan:
Slope One Predictors for Online Rating-Based Collaborative Filtering.
SDM 2005 |
| 4 | | Daniel Lemire:
Scale and Translation Invariant Collaborative Filtering Systems.
Inf. Retr. 8(1): 129-150 (2005) |
| 3 | | 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) |
| 2003 |
|---|
| 2 | | Owen Kaser,
Daniel Lemire:
Attribute value reordering for efficient hybrid OLAP.
DOLAP 2003: 1-8 |
| 2002 |
|---|
| 1 | | Daniel Lemire:
Wavelet-based relative prefix sum methods for range sum queries in data cubes.
CASCON 2002: 6 |
Data released under the ODC-BY 1.0 license — See also our legal information page