827 search results - page 72 / 166 » The Complexity of Probabilistic Lobbying |
160
click to vote
COCO
2007
Springer
16 years 15 days ago
2007
Springer
Antunes, Fortnow, van Melkebeek and Vinodchandran captured the notion of non-random information by computational depth, the difference between the polynomialtime-bounded Kolmogoro...
164
click to vote
ACMSE
2006
ACM
15 years 10 months ago
2006
ACM
In this paper, we offer an exposition of a theorem originally due to Adleman, Demarrais and Huang that shows that the quantum complexity class BQP (Bounded-error Quantum Polynomia...
177
click to vote
IPL
2006
15 years 6 months ago
2006
A precise analysis of the retrieval of signature trees is presented. A signature tree is a data structure constructed over a signature file to speed up searching all those signatu...
177
click to vote
IJSI
2008
15 years 6 months ago
2008
Abstract In a line of recent development, probabilistic constructions of universal, homogeneous objects have been provided in various categories of ordered structures, such as caus...
151
click to vote
SEMWEB
2007
Springer
16 years 13 days ago
2007
Springer
Abstract. We present a novel approach to representing uncertain information in ontologies based on design patterns. We provide a brief description of our approach, present its use ...