3875 search results - page 89 / 775 » Approximation algorithms for the 0-extension problem |
131
click to vote
PODS
2008
ACM
16 years 4 months ago
2008
ACM
Co-clustering is the simultaneous partitioning of the rows and columns of a matrix such that the blocks induced by the row/column partitions are good clusters. Motivated by severa...
121
click to vote
IPL
2006
15 years 4 months ago
2006
We study the NP-hard problem of labeling points with maximum-radius circle pairs: given n point sites in the plane, find a placement for 2n interior-disjoint uniform circles, such...
161
click to vote
SWAT
2010
Springer
15 years 9 months ago
2010
Springer
Inspired by air traffic control and other applications where moving objects have to be labeled, we consider the following (static) point labeling problem: given a set P of n points...
119
click to vote
ICASSP
2011
IEEE
14 years 8 months ago
2011
IEEE
In this paper we present a novel approach to describe sound mixtures which is based on a geometric viewpoint. In this approach we extend the idea of a nearest-neighbor representat...
227
click to vote
DC
2011
14 years 4 months ago
2011
Abstract This paper gives poly-logarithmic-round, distributed δ-approximation algorithms for covering problems with submodular cost and monotone covering constraints (Submodular-c...