I agree that this site is using cookies. You can find further informations here.
X
Kaser, Owen
60  results:
Search for persons X
?
1

Integer division by constants: optimal bounds:

Lemire, Daniel ; Bartlett, Colin ; Kaser, Owen
Heliyon.  7 (2021)  6 - p. e07442 , 2021
Link: https://doi.org/10.1016/..
 
?
2

Faster remainder by direct computation: Applications to com..:

Lemire, Daniel ; Kaser, Owen ; Kurz, Nathan
Software: Practice and Experience.  49 (2019)  6 - p. 953-970 , 2019
Link: https://doi.org/10.1002/..
 
?
3

Roaring bitmaps: Implementation of an optimized software li..:

Lemire, Daniel ; Kaser, Owen ; Kurz, Nathan...
Software: Practice and Experience.  48 (2018)  4 - p. 867-895 , 2018
Link: https://doi.org/10.1002/..
 
?
4

Consistently faster and smaller compressed bitmaps with Roa..:

Lemire, Daniel ; Ssi‐Yan‐Kai, Gregory ; Kaser, Owen
Software: Practice and Experience.  46 (2016)  11 - p. 1547-1569 , 2016
Link: https://doi.org/10.1002/..
 
?
5

Faster 64-bit universal hashing using carry-less multiplica..:

Lemire, Daniel ; Kaser, Owen
Journal of Cryptographic Engineering.  6 (2015)  3 - p. 171-185 , 2015
Link: https://doi.org/10.1007/..
 
?
6

Better bitmap performance with Roaring bitmaps:

Chambi, Samy ; Lemire, Daniel ; Kaser, Owen.
Software: Practice and Experience.  46 (2015)  5 - p. 709-719 , 2015
Link: https://doi.org/10.1002/..
 
?
7

Compressed bitmap indexes: beyond unions and intersections:

Kaser, Owen ; Lemire, Daniel
Software: Practice and Experience.  46 (2014)  2 - p. 167-198 , 2014
Link: https://doi.org/10.1002/..
 
?
8

Diamond dicing:

Webb, Hazel ; Lemire, Daniel ; Kaser, Owen
Data & Knowledge Engineering.  86 (2013)  - p. 1-18 , 2013
Link: https://doi.org/10.1016/..
 
?
9

Reordering rows for better compression : Beyond the lexi..:

Lemire, Daniel ; Kaser, Owen ; Gutarra, Eduardo
ACM Transactions on Database Systems (TODS).  37 (2012)  3 - p. 1-29 , 2012
Link: https://dl.acm.org/doi/1..
 
?
10

Reordering rows for better compression: Beyond the lexicogr..:

Lemire, Daniel ; Kaser, Owen ; Gutarra, Eduardo
ACM Transactions on Database Systems.  37 (2012)  3 - p. 1-29 , 2012
Link: https://doi.org/10.1145/..
 
?
11

Reordering columns for smaller indexes:

Lemire, Daniel ; Kaser, Owen
Information Sciences.  181 (2011)  12 - p. 2550-2570 , 2011
Link: https://doi.org/10.1016/..
 
?
12

Recursive n-gram hashing is pairwise independent, at best:

Lemire, Daniel ; Kaser, Owen
Computer Speech & Language.  24 (2010)  4 - p. 698-710 , 2010
Link: https://doi.org/10.1016/..
 
?
13

Sorting improves word-aligned bitmap indexes:

Lemire, Daniel ; Kaser, Owen ; Aouiche, Kamel
Data & Knowledge Engineering.  69 (2010)  1 - p. 3-28 , 2010
Link: https://doi.org/10.1016/..
 
?
14

Histogram-aware sorting for enhanced word-aligned compressi..:

, In: Proceedings of the ACM 11th international workshop on Data warehousing and OLAP,
Kaser, Owen ; Lemire, Daniel ; Aouiche, Kamel - p. 1-8 , 2008
Link: https://dl.acm.org/doi/1..
 
?
15

Hierarchical bin buffering : Online local moments for dy..:

Lemire, Daniel ; Kaser, Owen
ACM Transactions on Algorithms (TALG).  4 (2008)  1 - p. 1-31 , 2008
Link: https://dl.acm.org/doi/1..
 
1-15