Pages that link to "Item:Q3192006"
From MaRDI portal
The following pages link to Tighter bounds for nearest neighbor search and related problems in the cell probe model (Q3192006):
Displaying 8 items.
- Indexability, concentration, and VC theory (Q450514) (← links)
- Tighter lower bounds for nearest neighbor search and related problems in the cell probe model (Q696979) (← links)
- A strong lower bound for approximate nearest neighbor searching (Q834886) (← links)
- Text indexing with errors (Q925060) (← links)
- Lower bounds on performance of metric tree indexing schemes for exact similarity search in high dimensions (Q1950389) (← links)
- Is the \(k\)-NN classifier in high dimensions affected by the curse of dimensionality? (Q2629451) (← links)
- Tight Cell-Probe Bounds for Online Hamming Distance Computation (Q5741756) (← links)
- Cell-probe lower bounds for the partial match problem (Q5917577) (← links)