Publication:4527027
From MaRDI portal
zbMath0963.68049MaRDI QIDQ4527027
Publication date: 28 February 2001
Related Items
An Improved Algorithm Finding Nearest Neighbor Using Kd-trees, Efficient image retrieval through vantage objects, Cell-probe lower bounds for the partial match problem, Tighter lower bounds for nearest neighbor search and related problems in the cell probe model, A strong lower bound for approximate nearest neighbor searching, An algorithmic theory of learning: robust concepts and random projection, Probably correct \(k\)-nearest neighbor search in high dimensions, Nearest neighbour group-based classification, Database-friendly random projections: Johnson-Lindenstrauss with binary coins., On computing the diameter of a point set in high dimensional Euclidean space., Maximal intersection queries in randomized input models, The Johnson-Lindenstrauss lemma almost characterizes Hilbert space, but not quite, Approximate range searching in higher dimension, An algorithmic theory of learning: Robust concepts and random projection