2924 search results - page 61 / 585 » Lower Bounds in Distributed Computing |
VLSID
2006
IEEE
14 years 2 months ago
2006
IEEE
The main result of this paper, proved as a theorem, is that a lower bound on the number of test vectors that detect each fault at least N times is N
ICALP
2003
Springer
14 years 2 months ago
2003
Springer
Abstract. We show lower bounds in the cell probe model for the redundancy/query time tradeoff of solutions to static data structure problems.
CORR
2010
Springer
13 years 9 months ago
2010
Springer
Let A be a self-adjoint operator acting over a space X endowed with a partition. We give lower bounds on the energy of a mixed state from its distribution in the partition and the...
IPSN
2005
Springer
14 years 2 months ago
2005
Springer
We bound the number of sensors required to achieve a desired level of sensing accuracy in a discrete sensor network application (e.g. distributed detection). We model the state of...
ECCC
2002
13 years 8 months ago
2002
We shall give simpler proofs of some lower bounds on monotone computations. We describe a simple condition on combinatorial structures, such that the rank of the matrix associated...