conftrace_
← Foundations
Computer Science › Foundations ›

Data Structures

39 papers

Papers per year

2
4
1
'10
'20
'25

Papers

Eiffel: Efficient and Flexible Software Packet Scheduling NSDI 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
Succinct Data Structures for NLP-at-Scale COLING 2016
Density-preserving quantization with application to graph downsampling COLT 2014
Buffer k-d Trees: Processing Massive Nearest Neighbor Queries on GPUs ICML 2014
Robust Bloom Filters for Large MultiLabel Classification Tasks NIPS 2013
Which Space Partitioning Tree to Use for Search? NIPS 2013
Randomized partition trees for exact nearest neighbor search COLT 2013
Learning to Search Efficiently in High Dimensions NIPS 2011
Link Discovery using Graph Feature Tracking NIPS 2010
Random Projection Trees Revisited NIPS 2010
Linear-time Algorithms for Pairwise Statistical Problems NIPS 2009
A learning framework for nearest neighbor search NIPS 2007