3894 search results - page 227 / 779 » Approximation Algorithms for Biclustering Problems |
163
click to vote
ALGOSENSORS
2008
Springer
15 years 8 months ago
2008
Springer
We consider the problem of counting a set of discrete point targets using a network of sensors under a minimalistic model. Each sensor outputs a single integer, the number of disti...
197
click to vote
ESA
2008
Springer
15 years 8 months ago
2008
Springer
Online interval selection is a problem in which intervals arrive one by one, sorted by their left endpoints. Each interval has a length and a non-negative weight associated with i...
186
click to vote
GLVLSI
2010
IEEE
15 years 6 months ago
2010
IEEE
We revisit voltage partitioning problem when the mapped voltages of functional units are predetermined. If energy consumption is estimated by formulation E = CV 2 , a published wo...
214
click to vote
ESA
2011
Springer
14 years 6 months ago
2011
Springer
We present a number of positive and negative results for variants of the matroid secretary problem. Most notably, we design a constant-factor competitive algorithm for the “rando...
179
click to vote
SODA
1992
ACM
15 years 7 months ago
1992
ACM
Given a family of disjoint polygons P1, P2, : : :, Pk in the plane, and an integer parameter m, it is NP-complete to decide if the Pi's can be pairwise separated by a polygon...