scientific article; zbMATH DE number 1775451
From MaRDI portal
Publication:4542584
zbMath1029.68542MaRDI QIDQ4542584
Eyal Kushilevitz, Yuval Rabani, Rafail Ostrovsky
Publication date: 1 August 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (14)
A new coding-based algorithm for finding closest pair of vectors ⋮ Iterative denoising ⋮ Decomposable algorithms for nearest neighbor computing ⋮ Approximate nearest neighbor search for \(\ell_{p}\)-spaces \((2 < p < \infty)\) via embeddings ⋮ Limitations on Quantum Dimensionality Reduction ⋮ Vector representations for efficient comparison and search for similar strings ⋮ Tighter lower bounds for nearest neighbor search and related problems in the cell probe model ⋮ Unnamed Item ⋮ Nearest neighbors search using point location in balls with applications to approximate Voronoi decompositions ⋮ An Improved Algorithm Finding Nearest Neighbor Using Kd-trees ⋮ On the Impossibility of Dimension Reduction for Doubling Subsets of $\ell_{p}$ ⋮ The black-box complexity of nearest-neighbor search ⋮ Towards a Theory of Intrusion Detection ⋮ On approximate nearest neighbors under \(l_\infty\) norm
This page was built for publication:
