Sciweavers

6 search results - page 2 / 2
» On the Cell Probe Complexity of Dynamic Membership
Sort
View
CORR
2010
Springer
249views Education» more  CORR 2010»
13 years 5 months ago
Lower Bounds on Near Neighbor Search via Metric Expansion
In this paper we show how the complexity of performing nearest neighbor (NNS) search on a metric space is related to the expansion of the metric space. Given a metric space we loo...
Rina Panigrahy, Kunal Talwar, Udi Wieder