53 search results - page 3 / 11 » Hardness of Embedding Metric Spaces of Equal Size |
STOC
2003
ACM
14 years 6 months ago
2003
ACM
The main question studied in this article may be viewed as a nonlinear analogue of Dvoretzky's theorem in Banach space theory or as part of Ramsey theory in combinatorics. Gi...
CODES
2006
IEEE
13 years 12 months ago
2006
IEEE
Embedded system optimization typically considers objectives such as cost, timing, buffer sizes and power consumption. Robustness criteria, i.e. sensitivity of the system to variat...
PAMI
2008
13 years 5 months ago
2008
This paper describes BoostMap, a method for efficient nearest neighbor retrieval under computationally expensive distance measures. Database and query objects are embedded into a v...
KDD
2007
ACM
14 years 6 months ago
2007
ACM
A good distance metric is crucial for many data mining tasks. To learn a metric in the unsupervised setting, most metric learning algorithms project observed data to a lowdimensio...
SIGMOD
2008
ACM
14 years 6 months ago
2008
ACM
Random sampling is an appealing approach to build synopses of large data streams because random samples can be used for a broad spectrum of analytical tasks. Users are often inter...