10988 search results - page 277 / 2198 » Algorithmic Folding Complexity |
164
Voted
COCO
2004
Springer
16 years 15 days ago
2004
Springer
We study the robustness of complete sets for various complexity classes. A complete set A is robust if for any f(n)-dense set S ∈ P, A−S is still complete, where f(n) ranges f...
204
click to vote
ECCV
2004
Springer
16 years 15 days ago
2004
Springer
Stochastic tracking of structured models in monolithic state spaces often requires modeling complex distributions that are difficult to represent with either parametric or sample...
203
click to vote
COLT
2003
Springer
16 years 10 days ago
2003
Springer
This paper studies sequence prediction based on the monotone Kolmogorov complexity Km=−log m, i.e. based on universal deterministic/one-part MDL. m is extremely close to Solomon...
172
click to vote
ECBS
2002
IEEE
16 years 2 days ago
2002
IEEE
Design and implementation of motion control applications includes the transition from control design to real-time system implementation. To make this transition smooth, the specif...
167
click to vote
VISUALIZATION
2002
IEEE
16 years 11 hour ago
2002
IEEE
We present a method for interactive rendering of large outdoor scenes. Complex polygonal plant models and whole plant populations are represented by relatively small sets of point...