501 search results - page 30 / 101 » Communication Lower Bounds Using Dual Polynomials |
ICALP
2005
Springer
14 years 2 months ago
2005
Springer
Motivated by the study of algorithmic problems in the domain of information security, in this paper, we study the complexity of a new class of computations over a collection of va...
ANOR
2005
13 years 8 months ago
2005
: We consider in this paper a two-machine flowshop scheduling problem in which the first machine processes jobs individually while the second machine processes jobs in batches. The...
SIAMCOMP
2000
13 years 8 months ago
2000
The interpolation method has been one of the main tools for proving lower bounds for propositional proof systems. Loosely speaking, if one can prove that a particular proof system ...
JSAC
2006
13 years 8 months ago
2006
Abstract--This work presents a channel model for the broadband characterization of power lines in presence of time variation of the loads. The model is characterized by taking into...
WADS
2007
Springer
14 years 2 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 ...