141 search results - page 8 / 29 » Bounding basis reduction properties |
CCS
2008
ACM
13 years 11 months ago
2008
ACM
Distance bounding protocols have been proposed for many security critical applications as a means of getting an upper bound on the physical distance to a communication partner. As...
PODC
2003
ACM
14 years 3 months ago
2003
ACM
This paper considers the problem of performing tasks in asynchronous distributed settings. This problem, called DoAll, has been substantially studied in synchronous models, but th...
JAPLL
2011
13 years 4 months ago
2011
The paper proposes a formal analysis of a theory of norms resulting from pulling together Anderson’s reduction, the analysis of counts-as, and a novel approach to the formal rep...
SIAMCOMP
2000
13 years 9 months ago
2000
The interpolation method has been one of the main tools for proving lower bounds for propositional proof systems. Loosely speaking, if one can prove that a particular proof system ...
APPROX
2005
Springer
14 years 3 months ago
2005
Springer
A large class of stochastic optimization problems can be modeled as minimizing an objective function f that depends on a choice of a vector x ∈ X, as well as on a random external...