Pages that link to "Item:Q1293352"

The following pages link to Nearest neighbor queries in metric spaces (Q1293352):

Displaying 43 items.

• Space exploration via proximity search (Q312150) (← links)
• Online capacity maximization in wireless networks (Q398842) (← links)
• On efficient \( k\)-optimal-location-selection query processing in metric spaces (Q528666) (← links)
• Iterative denoising (Q626230) (← links)
• Making doubling metrics geodesic (Q627522) (← links)
• A QPTAS for TSP with fat weakly disjoint neighborhoods in doubling metrics (Q650109) (← links)
• Reducing non-determinism of \(k\)-NN searching in non-ordered discrete data spaces (Q656596) (← links)
• Efficient distance computation in configuration space (Q735495) (← links)
• Probabilistic proximity searching algorithms based on compact partitions (Q876710) (← links)
• On the angle restricted nearest neighbor problem (Q910232) (← links)
• Approximate similarity search: a multi-faceted problem (Q1013071) (← links)
• Smoothed analysis of probabilistic roadmaps (Q1028227) (← links)
• An O(n log n) algorithm for the all-nearest-neighbors problem (Q1115187) (← links)
• Satisfying general proximity/similarity queries with metric trees (Q1183466) (← links)
• Chromatic nearest neighbor searching: A query sensitive approach (Q1595399) (← links)
• Extending range queries and nearest neighbors (Q1841241) (← links)
• Probabilistic proximity search: Fighting the curse of dimensionality in metric spaces. (Q1853173) (← links)
• Nearest neighbor classification with excluding assumption. (Q1866682) (← links)
• Flip distance to some plane configurations (Q2331207) (← links)
• Self-organizing flows in social networks (Q2345453) (← links)
• Randomized partition trees for nearest neighbor search (Q2345949) (← links)
• Packing and covering with balls on Busemann surfaces (Q2358828) (← links)
• Linear-size approximations to the Vietoris-Rips filtration (Q2391709) (← links)
• On reporting the \(L_1\) metric closest pair in a query rectangle (Q2446069) (← 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)
• Self-organizing Flows in Social Networks (Q2868636) (← links)
• New Doubling Spanners: Better and Simpler (Q2954370) (← links)
• Simultaneous nearest neighbor search (Q3132879) (← links)
• Space-Time Tradeoffs for Proximity Searching in Doubling Spaces (Q3541079) (← links)
• (Q4738495) (← links)
• Dual‐tree fast exact max‐kernel search (Q4969941) (← links)
• (Q5009572) (← links)
• Flip Distance to some Plane Configurations. (Q5116475) (← links)
• Determining Cosine Similarity Neighborhoods by Means of the Euclidean Distance (Q5245315) (← links)
• Practical Construction of k-Nearest Neighbor Graphs in Metric Spaces (Q5307533) (← links)
• On the Least Cost for Proximity Searching in Metric Spaces (Q5307550) (← links)
• Automata, Languages and Programming (Q5466520) (← links)
• (Q5701518) (← links)
• Small hop-diameter sparse spanners for doubling metrics (Q5901493) (← links)
• A family of pairwise multi-marginal optimal transports that define a generalized metric (Q6097155) (← links)
• A Modern View on Stability of Approximation (Q6163638) (← links)
• The projector algorithm: a simple parallel algorithm for computing Voronoi diagrams and Delaunay graphs (Q6168083) (← links)