3415 search results - page 160 / 683 » Lower Bounds for Kernelizations |
152
Voted
STOC
2007
ACM
16 years 4 months ago
2007
ACM
The quantum adversary method is one of the most successful techniques for proving lower bounds on quantum query complexity. It gives optimal lower bounds for many problems, has ap...
128
click to vote
COCOON
2007
Springer
15 years 10 months ago
2007
Springer
We consider the problem of scheduling a set of equal-length intervals arriving online, where each interval is associated with a weight and the objective is to maximize the total we...
109
click to vote
WADS
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Assumptions about node density in the Sensor Networks literature are frequently too strong or too weak. Neither absolutely arbitrary nor uniform deployment seem feasible ...
143
Voted
ESA
2001
Springer
15 years 9 months ago
2001
Springer
We study the completion time of broadcast operations on static ad hoc wireless networks in presence of unpredictable and dynamical faults. Concerning oblivious fault-tolerant dist...
123
click to vote
ICCAD
1998
IEEE
15 years 8 months ago
1998
IEEE
Presented in this paper are 1) information-theoretic lower bounds on energy consumption of noisy digital gates and 2) the concept of noise tolerance via coding for achieving energy...