7930 search results - page 251 / 1586 » Greedy in Approximation Algorithms |
161
click to vote
WADS
2005
Springer
16 years 1 days ago
2005
Springer
We analyze the performance of simple algorithms for matching two planar point sets under rigid transformations so as to minimize the directed Hausdorff distance between the sets....
185
click to vote
CISS
2007
IEEE
16 years 27 days ago
2007
IEEE
—We consider information retrieval in a wireless sensor network deployed to monitor a spatially correlated random field. We address sensor scheduling in each data collection und...
171
click to vote
ECML
2004
Springer
15 years 12 months ago
2004
Springer
In this paper we present a boosting approach to multiple instance learning. As weak hypotheses we use balls (with respect to various metrics) centered at instances of positive bags...
147
click to vote
STACS
2004
Springer
15 years 12 months ago
2004
Springer
We consider the problem of preemptive scheduling on uniformly related machines. We present a semi-online algorithm which, if the optimal makespan is given in advance, produces an ...
177
click to vote
IPCO
2010
15 years 8 months ago
2010
Hypergraph multiway cut problem is a problem of finding a minimum capacity set of hyperedges whose removal divides a given hypergraph into a specified number of connected componen...