3875 search results - page 135 / 775 » Approximation algorithms for the 0-extension problem |
121
click to vote
APPROX
2004
Springer
15 years 10 months ago
2004
Springer
We consider the problem of fitting metric data on n points to a path (line) metric. Our objective is to minimize the total additive distortion of this mapping. The total additive ...
150
Voted
PODS
2008
ACM
16 years 4 months ago
2008
ACM
There is an increasing quantity of data with uncertainty arising from applications such as sensor network measurements, record linkage, and as output of mining algorithms. This un...
186
click to vote
COMGEO
2004
ACM
15 years 4 months ago
2004
ACM
In k-means clustering we are given a set of n data points in d-dimensional space d and an integer k, and the problem is to determine a set of k points in d , called centers, to mi...
152
click to vote
DCOSS
2006
Springer
15 years 8 months ago
2006
Springer
We develop algorithms for finding the minimum energy transmission schedule for duty-cycle and rate constrained wireless sensor nodes transmitting over an interference channel. Sinc...
128
Voted
IPCCC
2007
IEEE
15 years 11 months ago
2007
IEEE
In this paper, we study the Maximum lifetime Target Coverage problem (MTC), which is to maximize the network lifetime while guaranteeing the complete coverage of all the targets. ...