Pages that link to "Item:Q2819560"
From MaRDI portal
The following pages link to Lower bounds for high dimensional nearest neighbor search and related problems (Q2819560):
Displaying 9 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)
- On approximate nearest neighbors under \(l_\infty\) norm (Q1604212) (← links)
- Graph-theoretic multisample tests of equality in distribution for high dimensional data (Q1659474) (← links)
- Evaluating top-\(N\) queries in \(n\)-dimensional normed spaces (Q2282287) (← links)
- An Improved Algorithm Finding Nearest Neighbor Using Kd-trees (Q5458545) (← links)
- Cell-probe lower bounds for the partial match problem (Q5917577) (← links)
