1331 search results - page 93 / 267 » Complexity bounds for zero-test algorithms |
STACS
2005
Springer
14 years 2 months ago
2005
Springer
We define and study the complexity of robust polynomials for Boolean functions and the related fault-tolerant quantum decision trees, where input bits are perturbed by noise. We ...
STOC
1993
ACM
14 years 1 months ago
1993
ACM
Let B be a set of n arbitrary possibly intersecting convex obstacles in Rd. It is shown that any two points which can be connected by a path avoiding the obstacles can also be c...
TWC
2010
13 years 3 months ago
2010
Wideband source localization using acoustic sensor networks has been drawing a lot of research interest recently in wireless communication applications, such as cellular handset lo...
AIPS
2004
13 years 10 months ago
2004
Resource envelopes provide the tightest exact bounds on the resource consumption and production caused by all possible executions of a temporally flexible plan. We present a new c...
VLSID
2003
IEEE
14 years 9 months ago
2003
IEEE
Functional decomposition is a process of splitting a complex circuit into smaller sub-circuits. This paper deals with the problem of determining the set of best free and bound var...