Finding nearest neighbors in growth-restricted metrics

DOI10.1145/509907.510013MaRDI QIDQ3579253zbMATH OpenOpenAlexFDO

Authors 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

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cited in

(31)

• Combinatorial and spectral aspects of nearest neighbor graphs in doubling dimensional and nearly-Euclidean spaces
• Distributed transactional memory for metric-space networks
• Fractal dimension and lower bounds for geometric problems
• Distributed transactional memory for general networks
• Maximal intersection queries in randomized input models
• Extreme-value-theoretic estimation of local intrinsic dimensionality
• Self-organizing flows in social networks
• Randomized partition trees for nearest neighbor search
• Choosing a random peer in Chord
• Gaussian fields for semi-supervised regression and correspondence learning
• The black-box complexity of nearest-neighbor search
• Parallel algorithms for nearest neighbor search problems in high dimensions
• Self-organizing flows in social networks
• Content search through comparisons
• Space-Time Tradeoffs for Proximity Searching in Doubling Spaces
• Dimension estimation using random connection models
• Dual‐tree fast exact max‐kernel search
• scientific article; zbMATH DE number 7236474 (Why is no real title available?)
• Low-distortion inference of latent similarities from a multiplex social network
• Local intrinsic dimension estimation by generalized linear modeling
• Optimal nearest neighbor queries in sensor networks
• Small hop-diameter sparse spanners for doubling metrics
• (1+)-ANN data structure for curves via subspaces of bounded doubling dimension
• Topological implications of selfish neighbor selection in unstructured peer-to-peer networks
• A data-dependent approach for high-dimensional (robust) Wasserstein alignment
• Fast geographic routing in fixed-growth graphs
• A simple and deterministic competitive algorithm for online facility location
• Approximating snowflake metrics by trees
• Towards communication-efficient Peer-to-Peer networks
• Sublinear data structures for nearest neighbor in ultra high dimensions
• Recovering the long-range links in augmented graphs

This page was built for publication: Finding nearest neighbors in growth-restricted metrics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3579253)