Data Structures

XRP: In-Kernel Storage Functions with eBPF OSDI 2022 A Novel Sequential Coreset Method for Gradient Descent Algorithms ICML 2021 Partitioned Learned Bloom Filters ICLR 2021 Adaptive Learned Bloom Filter (Ada-BF): Efficient Utilization of the Classifier with Application to Real-Time Information Filtering on the Web NeurIPS 2020 Learning Context-free Languages with Nondeterministic Stack RNNs CoNLL 2020 Rescore in a Flash: Compact, Cache Efficient Hashing Data Structures for n-Gram Language Models Interspeech 2020 WOR and p's: Sketches for ℓ_p-Sampling Without Replacement NeurIPS 2020 An Improved Hierarchical Datastructure for Nearest Neighbor Search AAAI 2019 Bi-Kronecker Functional Decision Diagrams: A Novel Canonical Representation of Boolean Functions AAAI 2019 Eiffel: Efficient and Flexible Software Packet Scheduling NSDI 2019 Group Decision Diagram (GDD): A Compact Representation for Permutations AAAI 2019 Toward Efficient Navigation of Massive-Scale Geo-Textual Streams IJCAI 2019 Noria: dynamic, partially-stateful data-flow for high-performance web applications OSDI 2018 Write-Optimized and High-Performance Hashing Index Scheme for Persistent Memory OSDI 2018 An algorithm for L1 nearest neighbor search via monotonic embedding NeurIPS 2016 Succinct Data Structures for NLP-at-Scale COLING 2016 Buffer k-d Trees: Processing Massive Nearest Neighbor Queries on GPUs ICML 2014 Density-preserving quantization with application to graph downsampling COLT 2014 Learning to Prune in Metric and Non-Metric Spaces NeurIPS 2013 Randomized partition trees for exact nearest neighbor search COLT 2013 Regression-tree Tuning in a Streaming Setting NeurIPS 2013 Robust Bloom Filters for Large MultiLabel Classification Tasks NeurIPS 2013 Which Space Partitioning Tree to Use for Search? NeurIPS 2013 Sketch-Based Linear Value Function Approximation NeurIPS 2012 Learning to Search Efficiently in High Dimensions NeurIPS 2011