986 search results - page 183 / 198 » Algorithmic Lower Bounds for Problems Parameterized by Cliqu... |
SIAMCOMP
2008
13 years 6 months ago
2008
Abstract. To cope with the impossibility of solving agreement problems in asynchronous systems made up of n processes and prone to t process crashes, system designers tailor their ...
FOCS
2008
IEEE
14 years 2 months ago
2008
IEEE
Abstract— We consider the approximate sparse recovery problem, where the goal is to (approximately) recover a highdimensional vector x ∈ Rn from its lower-dimensional sketch Ax...
COMPGEOM
2004
ACM
13 years 11 months ago
2004
ACM
We introduce a new approach to the problem of collision detection between a rotating milling-cutter of an NC-machine and a model of a solid workpiece, as the rotating cutter conti...
INFOCOM
2007
IEEE
14 years 1 months ago
2007
IEEE
— We propose a general family of MAC scheduling algorithms that achieve any rate-point on a uniform discretelattice within the throughput-region (i.e., lattice-throughputoptimal)...
MST
2000
13 years 7 months ago
2000
We consider the problem of processing a given number of tasks on a given number of processors as quickly as possible when only vague information about the processing time of a task...