3894 search results - page 480 / 779 » Approximation Algorithms for Biclustering Problems |
169
click to vote
ICALP
2011
Springer
14 years 8 months ago
2011
Springer
We consider the following Tree-Constrained Bipartite Matching problem: Given two rooted trees T1 = (V1, E1), T2 = (V2, E2) and a weight function w : V1 × V2 → R+, find a maximu...
131
click to vote
CDC
2008
IEEE
15 years 11 months ago
2008
IEEE
Abstract— This paper presents new algorithms for conducting cooperative sensing using a mobile backbone network. This hierarchical sensing approach combines backbone nodes, which...
126
click to vote
COLT
2008
Springer
15 years 6 months ago
2008
Springer
We study the problem of clustering discrete probability distributions with respect to the Kullback-Leibler (KL) divergence. This problem arises naturally in many applications. Our...
131
click to vote
TCS
2008
15 years 4 months ago
2008
We introduce a new problem that was motivated by a (more complicated) problem arising in a robotized assembly environment. The bin coloring problem is to pack unit size colored it...
120
click to vote
AIPS
2004
15 years 5 months ago
2004
We present new results on the problem of finding an enclosing rectangle of minimum area that will contain a given a set of rectangles. Many simple scheduling tasks can be modelled...