2434 search results - page 325 / 487 » Algorithmic Randomness of Closed Sets |
142
click to vote
DAC
2002
ACM
16 years 7 months ago
2002
ACM
We propose a false-path-aware statistical timing analysis framework. In our framework, cell as well as interconnect delays are assumed to be correlated random variables. Our tool ...
173
click to vote
ICPR
2008
IEEE
16 years 23 days ago
2008
IEEE
We present a promising analysis on using the pattern of symmetry in the face to increase the accuracy of three-dimensional face recognition. We introduce the concept of the ‘ave...
154
click to vote
COLT
2007
Springer
16 years 15 days ago
2007
Springer
Abstract. We establish a generic theoretical tool to construct probabilistic bounds for algorithms where the output is a subset of objects from an initial pool of candidates (or mo...
172
click to vote
CSCLP
2007
Springer
16 years 15 days ago
2007
Springer
We formulate a problem of goal satisfaction in mutex networks in this paper. The proposed problem is motivated by problems that arise in concurrent planning. For more efficient sol...
183
click to vote
FCT
2007
Springer
16 years 15 days 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 ...