986 search results - page 57 / 198 » Algorithmic Lower Bounds for Problems Parameterized by Cliqu... |
COCO
1991
Springer
13 years 11 months ago
1991
Springer
We consider the deterministic and the randomized decision tree complexities for Boolean functions, denoted DC(f) and RC(f), respectively. A major open problem is how small RC(f) ca...
MASS
2010
13 years 5 months ago
2010
We study a problem in which a single sensor is scheduled to observe sites periodically, motivated by applications in which the goal is to maintain up-to-date readings for all the o...
MFCS
2005
Springer
14 years 1 months ago
2005
Springer
We study online interval coloring problems with bandwidth. We are interested in some variants motivated by bin packing problems. Specifically we consider open-end coloring, cardin...
COMPGEOM
2006
ACM
14 years 1 months ago
2006
ACM
The k-means method is an old but popular clustering algorithm known for its observed speed and its simplicity. Until recently, however, no meaningful theoretical bounds were known...
STOC
2009
ACM
14 years 8 months ago
2009
ACM
We give near-optimal space bounds in the streaming model for linear algebra problems that include estimation of matrix products, linear regression, low-rank approximation, and app...