The following pages link to (Q5501341):
Displaying 50 items.
- A sensor-based framework for kinetic data compression (Q482331) (← links)
- Boosting conditional probability estimators (Q513339) (← links)
- Making doubling metrics geodesic (Q627522) (← links)
- A QPTAS for TSP with fat weakly disjoint neighborhoods in doubling metrics (Q650109) (← links)
- Pattern matching in doubling spaces (Q832835) (← links)
- ANN for time series under the Fréchet distance (Q832871) (← links)
- A nonlinear approach to dimension reduction (Q894683) (← links)
- Using the doubling dimension to analyze the generalization of learning algorithms (Q923877) (← links)
- On metric clustering to minimize the sum of radii (Q970610) (← links)
- Approximation algorithm for the kinetic robust \(k\)-center problem (Q982946) (← links)
- Manhattan orbifolds (Q1044880) (← links)
- Nearest neighbor queries in metric spaces (Q1293352) (← links)
- Gaussian random projections for Euclidean membership problems (Q1634768) (← links)
- Approximate nearest neighbor search for \(\ell_{p}\)-spaces \((2 < p < \infty)\) via embeddings (Q1711830) (← links)
- Distance estimation and object location via rings of neighbors (Q1954208) (← links)
- Distributed transactional memory for metric-space networks (Q1954240) (← links)
- Random projection-based auxiliary information can improve tree-based nearest neighbor search (Q2055550) (← links)
- Non-uniform packings (Q2059874) (← links)
- Near-neighbor preserving dimension reduction via coverings for doubling subsets of \(\ell_1\) (Q2110372) (← links)
- Load balanced distributed directories (Q2139097) (← links)
- \textsf{StreaMRAK} a streaming multi-resolution adaptive kernel algorithm (Q2141175) (← links)
- Dynamic clustering to minimize the sum of radii (Q2205631) (← links)
- Distributed transactional memory for general networks (Q2256963) (← links)
- Maximal intersection queries in randomized input models (Q2268345) (← links)
- An \(O(\log n)\) query time algorithm for reducing \(\varepsilon \)-NN to \((c,r)\)-NN (Q2283022) (← links)
- Randomized partition trees for nearest neighbor search (Q2345949) (← links)
- Deformable spanners and applications (Q2507157) (← links)
- Metric structures in \(L_1\): dimension, snowflakes, and average distortion (Q2567204) (← links)
- The black-box complexity of nearest-neighbor search (Q2581270) (← links)
- The traveling salesman problem: low-dimensionality implies a polynomial time approximation scheme (Q2817793) (← links)
- Parallel algorithms for nearest neighbor search problems in high dimensions (Q2830635) (← links)
- Content Search through Comparisons (Q3012951) (← links)
- On Metric Clustering to Minimize the Sum of Radii (Q3512466) (← links)
- Space-Time Tradeoffs for Proximity Searching in Doubling Spaces (Q3541079) (← links)
- An Optimal Dynamic Spanner for Doubling Metric Spaces (Q3541109) (← links)
- Active Nearest-Neighbor Learning in Metric Spaces (Q4558521) (← links)
- (Q4636980) (← links)
- Dual‐tree fast exact max‐kernel search (Q4969941) (← links)
- (Q5111737) (← links)
- Economical Delone Sets for Approximating Convex Bodies (Q5116467) (← links)
- CoverBLIP: accelerated and scalable iterative matched-filtering for magnetic resonance fingerprint reconstruction* (Q5210429) (← links)
- Low-Distortion Inference of Latent Similarities from a Multiplex Social Network (Q5255011) (← links)
- On the Impossibility of Dimension Reduction for Doubling Subsets of $\ell_{p}$ (Q5499733) (← links)
- Near-Neighbor Preserving Dimension Reduction for Doubling Subsets of L1 (Q5875504) (← links)
- Optimal nearest neighbor queries in sensor networks (Q5899559) (← links)
- Small hop-diameter sparse spanners for doubling metrics (Q5901493) (← links)
- Fully dynamic geometric spanners (Q5920251) (← links)
- Adaptive metric dimensionality reduction (Q5964069) (← links)
- Online Spanners in Metric Spaces (Q6195959) (← links)
- A data-dependent approach for high-dimensional (robust) Wasserstein alignment (Q6579774) (← links)
