1132 search results - page 130 / 227 » Upper and lower Ramsey bounds in bounded arithmetic |
172
click to vote
WDAG
2010
Springer
15 years 4 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,...
152
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...
163
click to vote
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...
253
click to vote
APPROX
2011
Springer
14 years 6 months ago
2011
Springer
In this work we consider the problem of approximating the number of relevant variables in a function given query access to the function. Since obtaining a multiplicative factor ap...
190
click to vote
CRYPTO
2001
Springer
15 years 11 months ago
2001
Springer
Consider a scenario where an l-bit secret has been distributed among n players by an honest dealer using some secret sharing scheme. Then, if all players behave honestly, the secre...