3415 search results - page 34 / 683 » Lower Bounds for Kernelizations |
CORR
2010
Springer
13 years 11 months ago
2010
Springer
Several analog-to-digital conversion methods for bandlimited signals used in applications, such as quantization schemes, employ coarse quantization coupled with oversampling. The...
CORR
2008
Springer
13 years 11 months ago
2008
Springer
We study the worst-case communication complexity of distributed algorithms computing a path problem based on stationary distributions of random walks in a network G with the caveat...
CORR
1998
Springer
13 years 10 months ago
1998
Springer
We prove lower bounds on the error probability of a quantum algorithm for searching through an unordered list of N items, as a function of the number T of queries it makes. In par...
CC
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. We prove lower bounds on the randomized two-party communication complexity of functions that arise from read-once boolean formulae. A read-once boolean formula is a formu...
GLOBECOM
2010
IEEE
13 years 9 months ago
2010
IEEE
In this paper, we are concerned with low-complexity detection in large multiple-input multiple-output (MIMO) systems with tens of transmit/receive antennas. Our new contributions i...