1331 search results - page 93 / 267 » Complexity bounds for zero-test algorithms |
103
click to vote
STACS
2005
Springer
15 years 8 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 ...
122
click to vote
STOC
1993
ACM
15 years 7 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...
150
click to vote
TWC
2010
14 years 9 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...
131
click to vote
AIPS
2004
15 years 4 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...
110
click to vote
VLSID
2003
IEEE
16 years 3 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...