Pages that link to "Item:Q834886"
From MaRDI portal
The following pages link to A strong lower bound for approximate nearest neighbor searching (Q834886):
Displaying 7 items.
- Tighter lower bounds for nearest neighbor search and related problems in the cell probe model (Q696979) (← links)
- Fast and versatile algorithm for nearest neighbor search based on a lower bound tree (Q854189) (← links)
- Lower bounds for predecessor searching in the cell probe model (Q2475409) (← links)
- Toward optimal \(\epsilon\)-approximate nearest neighbor algorithms (Q2775898) (← links)
- A lower bound on the complexity of approximate nearest-neighbor searching on the Hamming cube (Q2819559) (← links)
- Approximate nearest neighbor search for low-dimensional queries (Q2839174) (← links)
- (Q5365086) (← links)
