Finding nearest neighbors in growth-restricted metrics
From MaRDI portal
Publication:3579253
DOI10.1145/509907.510013zbMath1192.68750OpenAlexW2169036209MaRDI QIDQ3579253
Matthias Ruhl, David R. Karger
Publication date: 5 August 2010
Published in: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/509907.510013
Related Items (27)
Topological implications of selfish neighbor selection in unstructured peer-to-peer networks ⋮ Distributed transactional memory for metric-space networks ⋮ Unnamed Item ⋮ Local Intrinsic Dimension Estimation by Generalized Linear Modeling ⋮ Space-Time Tradeoffs for Proximity Searching in Doubling Spaces ⋮ Choosing a random peer in Chord ⋮ Content Search through Comparisons ⋮ Optimal nearest neighbor queries in sensor networks ⋮ Small hop-diameter sparse spanners for doubling metrics ⋮ Recovering the long-range links in augmented graphs ⋮ Distributed transactional memory for general networks ⋮ A simple and deterministic competitive algorithm for online facility location ⋮ Maximal intersection queries in randomized input models ⋮ Gaussian fields for semi-supervised regression and correspondence learning ⋮ Approximating snowflake metrics by trees ⋮ Extreme-value-theoretic estimation of local intrinsic dimensionality ⋮ Fractal dimension and lower bounds for geometric problems ⋮ Combinatorial and spectral aspects of nearest neighbor graphs in doubling dimensional and nearly-Euclidean spaces ⋮ Unnamed Item ⋮ Dual‐tree fast exact max‐kernel search ⋮ Parallel Algorithms for Nearest Neighbor Search Problems in High Dimensions ⋮ Dimension Estimation Using Random Connection Models ⋮ Low-Distortion Inference of Latent Similarities from a Multiplex Social Network ⋮ The black-box complexity of nearest-neighbor search ⋮ Self-organizing flows in social networks ⋮ Randomized partition trees for nearest neighbor search ⋮ Self-organizing Flows in Social Networks
This page was built for publication: Finding nearest neighbors in growth-restricted metrics
