1677 search results - page 270 / 336 » On the Completeness of Quantum Computation Models |
177
click to vote
EUROGRAPHICS
2010
Eurographics
16 years 3 months ago
2010
Eurographics
We present a new technique to implement operators that modify the topology of polygonal meshes at intersections and self-intersections. Depending on the modification strategy, th...
212
click to vote
EUROGRAPHICS
2010
Eurographics
16 years 3 months ago
2010
Eurographics
This paper presents a novel interactive approach for adding depth information into hand-drawn cartoon images and animations. In comparison to previous depth assignment techniques ...
207
click to vote
CCA
2009
Springer
16 years 1 months ago
2009
Springer
In the theory of algorithmic randomness, several notions of random sequence are defined via a game-theoretic approach, and the notions that received most attention are perhaps Mar...
227
click to vote
SIAMCOMP
2010
15 years 5 months ago
2010
We reexamine what it means to compute Nash equilibria and, more generally, what it means to compute a fixed point of a given Brouwer function, and we investigate the complexity o...
217
click to vote
CVPR
2004
IEEE
16 years 8 months ago
2004
IEEE
We present a complete system for the purpose of automatically assembling 3D pots given 3D measurements of their fragments commonly called sherds. A Bayesian approach is formulated...