3894 search results - page 486 / 779 » Approximation Algorithms for Biclustering Problems |
136
click to vote
SWAT
2004
Springer
15 years 9 months ago
2004
Springer
Let A and B be two sets of n resp. m disjoint unit disks in the plane, with m ≥ n. We consider the problem of finding a translation or rigid motion of A that maximizes the tota...
164
click to vote
INFOCOM
2007
IEEE
15 years 10 months ago
2007
IEEE
— This paper studies the tradeoff between energy consumption and application performance in wireless sensor networks by investigating the interaction between network lifetime max...
141
click to vote
CVPR
2012
IEEE
13 years 6 months ago
2012
IEEE
A popular approach to pixel labeling problems, such as multiclass image segmentation, is to construct a pairwise conditional Markov random field (CRF) over image pixels where the...
140
click to vote
MST
2006
15 years 4 months ago
2006
A central question in computational biology is the design of genetic markers to distinguish between two given sets of (DNA) sequences. This question is formalized as the NP-comple...
176
click to vote
FOCS
2010
IEEE
15 years 2 months ago
2010
IEEE
We consider k-median clustering in finite metric spaces and k-means clustering in Euclidean spaces, in the setting where k is part of the input (not a constant). For the k-means pr...