scientific article; zbMATH DE number 6469222
From MaRDI portal
Publication:5501341
zbMath1318.68071MaRDI QIDQ5501341
James R. Lee, Robert Krauthgamer
Publication date: 3 August 2015
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Searching and sorting (68P10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05) Approximation algorithms (68W25)
Related Items (49)
Pattern matching in doubling spaces ⋮ ANN for time series under the Fréchet distance ⋮ Load balanced distributed directories ⋮ Gaussian random projections for Euclidean membership problems ⋮ \textsf{StreaMRAK} a streaming multi-resolution adaptive kernel algorithm ⋮ A nonlinear approach to dimension reduction ⋮ Fully dynamic clustering and diversity maximization in doubling metrics ⋮ Making doubling metrics geodesic ⋮ On Metric Clustering to Minimize the Sum of Radii ⋮ Online Spanners in Metric Spaces ⋮ Dynamic clustering to minimize the sum of radii ⋮ Distance estimation and object location via rings of neighbors ⋮ Distributed transactional memory for metric-space networks ⋮ Approximate nearest neighbor search for \(\ell_{p}\)-spaces \((2 < p < \infty)\) via embeddings ⋮ A QPTAS for TSP with fat weakly disjoint neighborhoods in doubling metrics ⋮ Using the doubling dimension to analyze the generalization of learning algorithms ⋮ Space-Time Tradeoffs for Proximity Searching in Doubling Spaces ⋮ An Optimal Dynamic Spanner for Doubling Metric Spaces ⋮ A sensor-based framework for kinetic data compression ⋮ Near-Neighbor Preserving Dimension Reduction for Doubling Subsets of L1 ⋮ Content Search through Comparisons ⋮ Optimal nearest neighbor queries in sensor networks ⋮ Boosting conditional probability estimators ⋮ Small hop-diameter sparse spanners for doubling metrics ⋮ Active Nearest-Neighbor Learning in Metric Spaces ⋮ Distributed transactional memory for general networks ⋮ On metric clustering to minimize the sum of radii ⋮ Maximal intersection queries in randomized input models ⋮ Approximation algorithm for the kinetic robust \(k\)-center problem ⋮ Deformable spanners and applications ⋮ An \(O(\log n)\) query time algorithm for reducing \(\varepsilon \)-NN to \((c,r)\)-NN ⋮ Adaptive metric dimensionality reduction ⋮ CoverBLIP: accelerated and scalable iterative matched-filtering for magnetic resonance fingerprint reconstruction* ⋮ Unnamed Item ⋮ Dual‐tree fast exact max‐kernel search ⋮ The Traveling Salesman Problem: Low-Dimensionality Implies a Polynomial Time Approximation Scheme ⋮ Random projection-based auxiliary information can improve tree-based nearest neighbor search ⋮ Fully dynamic geometric spanners ⋮ Non-uniform packings ⋮ Parallel Algorithms for Nearest Neighbor Search Problems in High Dimensions ⋮ On the Impossibility of Dimension Reduction for Doubling Subsets of $\ell_{p}$ ⋮ Manhattan orbifolds ⋮ Metric structures in \(L_1\): dimension, snowflakes, and average distortion ⋮ Economical Delone Sets for Approximating Convex Bodies ⋮ Low-Distortion Inference of Latent Similarities from a Multiplex Social Network ⋮ Unnamed Item ⋮ The black-box complexity of nearest-neighbor search ⋮ Randomized partition trees for nearest neighbor search ⋮ Near-neighbor preserving dimension reduction via coverings for doubling subsets of \(\ell_1\)
This page was built for publication:
