3875 search results - page 632 / 775 » Approximation algorithms for the 0-extension problem |
158
click to vote
SODA
2003
ACM
15 years 6 months ago
2003
ACM
Motivated by several applications, we introduce various distance measures between “top k lists.” Some of these distance measures are metrics, while others are not. For each of...
163
click to vote
VCIP
2003
15 years 6 months ago
2003
In order to transmit or store three-dimensional (3-D) mesh models efficiently, we need to simplify them. Although the quadric error metric (QEM) provides fast and accurate geometr...
153
click to vote
CSDA
2006
15 years 5 months ago
2006
The three-mode partitioning model is a clustering model for three-way three-mode data sets that implies a simultaneous partitioning of all three modes involved in the data. In the...
151
click to vote
EDBT
2004
ACM
16 years 5 months ago
2004
ACM
Abstract. Recent years have witnessed an increasing interest in designing algorithms for querying and analyzing streaming data (i.e., data that is seen only once in a fixed order) ...
170
click to vote
ICALP
2004
Springer
15 years 11 months ago
2004
Springer
We define a natural notion of efficiency for approximate nearest-neighbor (ANN) search in general n-point metric spaces, namely the existence of a randomized algorithm which answ...