2924 search results - page 9 / 585 » Lower Bounds in Distributed Computing |
STOC
2012
ACM
11 years 10 months ago
2012
ACM
We give the first time-space tradeoff lower bounds for Resolution proofs that apply to superlinear space. In particular, we show that there are formulas of size N that have Reso...
COMPGEOM
2010
ACM
14 years 19 days ago
2010
ACM
Orthogonal range reporting is the problem of storing a set of n points in d-dimensional space, such that the k points in an axis-orthogonal query box can be reported efficiently. ...
IWCMC
2006
ACM
14 years 1 months ago
2006
ACM
We derive new upper and lower bounds on the fading number of multiple-input single-output (MISO) fading channels of general (not necessarily Gaussian) regular law with spatial and...
FMCAD
2004
Springer
14 years 28 days ago
2004
Springer
Most symbolic model checkers are based on either Binary Decision Diagrams (BDDs), which may grow exponentially large, or Satisfiability (SAT) solvers, whose time requirements rapi...
CDC
2008
IEEE
13 years 9 months ago
2008
IEEE
Abstract-- A network of nodes communicate via noisy channels. Each node has some real-valued initial measurement or message. The goal of each of the nodes is to acquire an estimate...