scientific article; zbMATH DE number 6469222
From MaRDI portal
Publication:5501341
zbMATH Open1318.68071MaRDI QIDQ5501341FDOQ5501341
Authors: Robert Krauthgamer, James R. Lee 
Publication date: 3 August 2015
Title of this publication is not available (Why is that?)
Recommendations
Data structures (68P05) Searching and sorting (68P10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)
Cited In (56)
- Fully dynamic clustering and diversity maximization in doubling metrics
- A data-dependent approach for high-dimensional (robust) Wasserstein alignment
- Online Spanners in Metric Spaces
- On Metric Clustering to Minimize the Sum of Radii
- Pattern matching in doubling spaces
- Optimal nearest neighbor queries in sensor networks
- Near-neighbor preserving dimension reduction via coverings for doubling subsets of \(\ell_1\)
- Fast Construction of Nets in Low-Dimensional Metrics and Their Applications
- Searching dynamic point sets in spaces with bounded doubling dimension
- Small hop-diameter sparse spanners for doubling metrics
- Manhattan orbifolds
- Adaptive metric dimensionality reduction
- ANN for time series under the Fréchet distance
- Approximation algorithm for the kinetic robust \(k\)-center problem
- Economical Delone sets for approximating convex bodies
- Using the doubling dimension to analyze the generalization of learning algorithms
- Gaussian random projections for Euclidean membership problems
- Multiscale strategies for computing optimal transport
- Dynamic clustering to minimize the sum of radii
- Load balanced distributed directories
- \textsf{StreaMRAK} a streaming multi-resolution adaptive kernel algorithm
- CoverBLIP: accelerated and scalable iterative matched-filtering for magnetic resonance fingerprint reconstruction
- Low-distortion inference of latent similarities from a multiplex social network
- Fully dynamic geometric spanners
- Title not available (Why is that?)
- Content search through comparisons
- Maximal intersection queries in randomized input models
- Distributed transactional memory for general networks
- A note on the nearest neighbor in growth-restricted metrics
- A nonlinear approach to dimension reduction
- Active nearest-neighbor learning in metric spaces
- Metric structures in \(L_1\): dimension, snowflakes, and average distortion
- Distributed transactional memory for metric-space networks
- Making doubling metrics geodesic
- Random projection-based auxiliary information can improve tree-based nearest neighbor search
- Space-Time Tradeoffs for Proximity Searching in Doubling Spaces
- A sensor-based framework for kinetic data compression
- Parallel algorithms for nearest neighbor search problems in high dimensions
- An \(O(\log n)\) query time algorithm for reducing \(\varepsilon \)-NN to \((c,r)\)-NN
- Non-uniform packings
- Randomized partition trees for nearest neighbor search
- Reactive proximity data structures for graphs
- Fast construction of nets in low dimensional metrics, and their applications
- The traveling salesman problem: low-dimensionality implies a polynomial time approximation scheme
- An Optimal Dynamic Spanner for Doubling Metric Spaces
- Distance estimation and object location via rings of neighbors
- On the impossibility of dimension reduction for doubling subsets of \(\ell_{p}\)
- A QPTAS for TSP with fat weakly disjoint neighborhoods in doubling metrics
- Near-Neighbor Preserving Dimension Reduction for Doubling Subsets of L1
- On metric clustering to minimize the sum of radii
- Dual‐tree fast exact max‐kernel search
- Boosting conditional probability estimators
- Deformable spanners and applications
- The black-box complexity of nearest-neighbor search
- Approximate nearest neighbor search for \(\ell_{p}\)-spaces \((2 < p < \infty)\) via embeddings
- Dynamic clustering to minimize the sum of radii
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5501341)
