2924 search results - page 398 / 585 » Lower Bounds in Distributed Computing |
149
click to vote
FUZZIEEE
2007
IEEE
15 years 11 months ago
2007
IEEE
— Possibilistic logic is essentially a formalism for handling qualitative uncertainty with an inference machinery that remains close to the one of classical logic. It is capable ...
122
click to vote
ICC
2007
IEEE
15 years 11 months ago
2007
IEEE
— The paper deals with the problem of the carrier frequency-offset (CFO) estimation for wireless communications. Since the well-known maximum-likelihood (ML) CFO estimator is rat...
116
click to vote
DRM
2007
Springer
15 years 11 months ago
2007
Springer
We introduce a data structure for program execution under a limited oblivious execution model. For fully oblivious execution along the lines of Goldreich and Ostrovsky [2], one tr...
147
Voted
ICALP
2007
Springer
15 years 11 months ago
2007
Springer
We revisit the problem of memory checking considered by Blum et al. [3]. In this model, a checker monitors the behavior of a data structure residing in unreliable memory given an a...
132
click to vote
ICALP
2007
Springer
15 years 11 months ago
2007
Springer
We study the classic problem of estimating the sum of n variables. The traditional uniform sampling approach requires a linear number of samples to provide any non-trivial guarante...