3415 search results - page 45 / 683 » Lower Bounds for Kernelizations |
CORR
2010
Springer
13 years 8 months ago
2010
Springer
We prove an optimal (n) lower bound on the randomized communication complexity of the much-studied GAP-HAMMING-DISTANCE problem. As a consequence, we obtain essentially optimal mu...
MASCOTS
2007
14 years 12 days ago
2007
— The transmission energy required for a wireless communication increases superlinearly with the communication distance. In a mobile wireless network, nodal movement can be explo...
EUROPAR
2009
Springer
14 years 5 months ago
2009
Springer
In this work we consider deterministic oblivious dimensional routing algorithms on d-dimensional meshes. In oblivious dimensional routing algorithms the path of a packet depends o...
COMPUTING
2007
13 years 11 months ago
2007
We present a general method for computing lower bounds for various caching problems. We apply the method to two well known problems, companion caching and weighted caching. For we...
ARSCOM
2004
13 years 11 months ago
2004
It was shown by Abrham that the number of pure Skolem sequences of order n, n 0 or 1 (mod 4), and the number of extended Skolem sequences of order n, are both bounded below by 2 ...