1632 search results - page 37 / 327 » Sublinear Time Algorithms for Metric Space Problems |
103
click to vote
ECCV
2008
Springer
16 years 5 months ago
2008
Springer
We propose a spatially continuous formulation of Ishikawa's discrete multi-label problem. We show that the resulting non-convex variational problem can be reformulated as a co...
127
Voted
TPDS
2002
15 years 3 months ago
2002
Sensor webs consisting of nodes with limited battery power and wireless communications are deployed to collect useful information from the field. Gathering sensed information in an...
159
click to vote
KDD
2007
ACM
16 years 3 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...
118
Voted
SODA
2004
ACM
15 years 4 months ago
2004
ACM
We propose a quasi-greedy algorithm for approximating the classical uncapacitated 2-level facility location problem (2-LFLP). Our algorithm, unlike the standard greedy algorithm, ...
130
click to vote
ALGORITHMICA
2008
15 years 3 months ago
2008
In this paper we present techniques to significantly improve the space complexity of several ordered tree comparison algorithms without sacrificing the corresponding time complexit...