Pages that link to "Item:Q2581270"
From MaRDI portal
The following pages link to The black-box complexity of nearest-neighbor search (Q2581270):
Displaying 8 items.
- Indexability, concentration, and VC theory (Q450514) (← links)
- Making doubling metrics geodesic (Q627522) (← links)
- A QPTAS for TSP with fat weakly disjoint neighborhoods in doubling metrics (Q650109) (← links)
- Fractal dimension and lower bounds for geometric problems (Q2039303) (← links)
- Space-Time Tradeoffs for Proximity Searching in Doubling Spaces (Q3541079) (← links)
- COMPUTING THE DISTANCE DISTRIBUTION OF SYSTEMATIC NONLINEAR CODES (Q3562516) (← links)
- Metric Spaces with Expensive Distances (Q5012870) (← links)
- (Q5116530) (← links)
