5595 search results - page 353 / 1119 » Approximation Algorithms for Clustering Problems |
173
click to vote
ISAAC
2009
Springer
16 years 1 months ago
2009
Springer
Given m unit disks and n points in the plane, the discrete unit disk cover problem is to select a minimum subset of the disks to cover the points. This problem is NP-hard [11] and ...
193
click to vote
TVCG
2011
15 years 1 months ago
2011
—This paper presents a fast parallel method to solve the radiative transport equation in inhomogeneous participating media. We apply a novel approximation scheme to find a good ...
187
click to vote
SPAA
2009
ACM
16 years 7 months ago
2009
ACM
Designing an overlay network for publish/subscribe communication in a system where nodes may subscribe to many different topics of interest is of fundamental importance. For scala...
161
Voted
ALGORITHMICA
2010
15 years 6 months ago
2010
Abstract Given an n-point metric (P,d) and an integer k > 0, we consider the problem of covering P by k balls so as to minimize the sum of the radii of the balls. We present a r...
224
click to vote
CIVR
2005
Springer
16 years 8 days ago
2005
Springer
Multiple Instance Learning (MIL) is a special kind of supervised learning problem that has been studied actively in recent years. We propose an approach based on One-Class Support ...