Sciweavers

86 search results - page 18 / 18
» Polytope-based computation of polynomial ranges
Sort
View
FOCS
2008
IEEE
13 years 11 months ago
A Geometric Approach to Lower Bounds for Approximate Near-Neighbor Search and Partial Match
This work investigates a geometric approach to proving cell probe lower bounds for data structure problems. We consider the approximate nearest neighbor search problem on the Bool...
Rina Panigrahy, Kunal Talwar, Udi Wieder