8196 search results - page 80 / 1640 » Computational Modeling and Complexity Science |
100
click to vote
SMC
2007
IEEE
15 years 4 months ago
2007
IEEE
—Rooted in a deep understanding of their major properties, a control paradigm for complex systems is proposed based on latest advances in modeling the dynamics of complex network...
ACMSE
2006
ACM
15 years 1 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...
LICS
2008
IEEE
15 years 4 months ago
2008
IEEE
We show that the asymptotic complexity of uniformly generated (expressible in First-Order (FO) logic) propositional tautologies for the Nullstellensatz proof system (NS) as well a...
ICALP
2004
Springer
15 years 3 months ago
2004
Springer
We define a natural notion of efficiency for approximate nearest-neighbor (ANN) search in general n-point metric spaces, namely the existence of a randomized algorithm which answ...
115
click to vote
WSCG
2003
14 years 11 months ago
2003
The visual representation of complex data has always been a major motivation for computer graphics. However, there have always been computer graphics scenes which were too complex...