3415 search results - page 326 / 683 » Lower bounds on kernelization |
184
click to vote
WDAG
2010
Springer
15 years 5 months ago
2010
Springer
We show that the asymptotic gain in the time complexity when using collision detection depends heavily on the task by investigating three prominent problems for wireless networks,...
202
click to vote
RSA
2011
15 years 1 months ago
2011
: The classical result in the theory of random graphs, proved by Erd˝os and Rényi in 1960, concerns the threshold for the appearance of the giant component in the random graph pr...
154
click to vote
TRANSCI
2011
15 years 1 months ago
2011
This paper presents a dynamic (or multi-period) hub location problem. It proposes a branch-and-bound algorithm that uses a Lagrangean relaxation to obtain lower and upper bounds a...
187
click to vote
JMLR
2010
15 years 1 months ago
2010
In this paper, we investigate the problem of binary classification with a reject option in which one can withhold the decision of classifying an observation at a cost lower than t...
174
Voted
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
Orthogonal frequency division multiplexing (OFDM) communication systems require accurate estimation of timing offset and channel impulse response in order to achieve desirable per...