1331 search results - page 83 / 267 » Complexity bounds for zero-test algorithms |
COCO
2007
Springer
14 years 2 months ago
2007
Springer
We consider the k-layer pointer jumping problem in the one-way multi-party number-on-the-forehead communication model. Sufficiently strong lower bounds for the problem would have...
COLT
2007
Springer
14 years 2 months ago
2007
Springer
We prove that the concept class of disjunctions cannot be pointwise approximated by linear combinations of any small set of arbitrary real-valued functions. That is, suppose there ...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
Linearity tests are randomized algorithms which have oracle access to the truth table of some function f, and are supposed to distinguish between linear functions and functions whi...
CG
2008
Springer
13 years 8 months ago
2008
Springer
This paper presents a fast approach for computing tight surface bounds in meshless animation, and its application to collision detection. Given a high-resolution surface animated ...
GLOBECOM
2006
IEEE
14 years 1 months ago
2006
IEEE
Abstract—Employing multiple base stations is an attractive approach to enhance the lifetime of wireless sensor networks. In this paper, we address the fundamental question concer...