2924 search results - page 132 / 585 » Lower Bounds in Distributed Computing |
99
Voted
CORR
2007
Springer
15 years 20 days ago
2007
Springer
— This paper considers the quantization problem on the Grassmann manifold with dimension n and p. The unique contribution is the derivation of a closed-form formula for the volum...
FOCS
2006
IEEE
15 years 6 months ago
2006
IEEE
In this work we study a wide range of online and offline routing and packing problems with various objectives. We provide a unified approach, based on a clean primal-dual method...
121
Voted
FCT
2007
Springer
15 years 6 months ago
2007
Springer
We present quantum query complexity bounds for testing algebraic properties. For a set S and a binary operation on S, we consider the decision problem whether S is a semigroup or ...
88
Voted
ECAI
2006
Springer
15 years 4 months ago
2006
Springer
Bounding constraints are used to bound the tolerance of solutions under certain undesirable features. Standard solvers propagate them one by one. Often times, it is easy to satisfy...
97
Voted
GLOBECOM
2008
IEEE
15 years 7 months ago
2008
IEEE
—In many wireless ad-hoc networks it is important to find a route that delivers a message to the destination within a certain deadline (delay constraint). We propose to identify...