Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

APPROX
2010
Springer

favoriteEmaildiscussreport

160views Algorithms» more APPROX 2010»

Proximity Algorithms for Nearly-Doubling Spaces

13 years 4 months ago

Proximity Algorithms for Nearly-Doubling Spaces

Download www.wisdom.weizmann.ac.il

We introduce a new problem in the study of doubling spaces: Given a point set S and a target dimension d , remove from S the fewest number of points so that the remaining set has doubling dimension at most d . We present a bicriteria approximation for this problem, and extend this algorithm to solve a group of proximity problems.

Lee-Ad Gottlieb, Robert Krauthgamer

Real-time Traffic

Algorithms | APPROX 2010 | Bicriteria Approximation | Fewest Number | Target Dimension |

claim paper

Related Content

» Proximity Searching in High Dimensional Spaces with a Proximity Preserving Order

» SpaceTime Tradeoffs for Proximity Searching in Doubling Spaces

» Using the kNearest Neighbor Graph for Proximity Searching in Metric Spaces

» ProxPenalization and Splitting Methods for Constrained Variational Problems

» Trace Norm Regularization Reformulations Algorithms and MultiTask Learning

» Navigating nets simple algorithms for proximity search

» Exploratory Analysis of Point Proximity in Subspaces

» Dimensionality reduction techniques for proximity problems

» A Brief Index for Proximity Searching

Post Info
More Details (n/a)

Added	06 Dec 2010
Updated	06 Dec 2010
Type	Conference
Year	2010
Where	APPROX
Authors	Lee-Ad Gottlieb, Robert Krauthgamer

Comments (0)