9842 search results - page 215 / 1969 » Problem complexity |
137
Voted
LATA
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. Motivated by strong Karp-Lipton collapse results in bounded arithmetic, Cook and Kraj´ıˇcek [7] have recently introduced the notion of propositional proof systems with...
100
click to vote
ISMAR
2007
IEEE
15 years 8 months ago
2007
IEEE
We present a non-rigid registration technique that achieves spatial, photometric, and visibility accuracy. It lets us photo-realistically augment 3D deformable surfaces under comp...
ATAL
2003
Springer
15 years 7 months ago
2003
Springer
In this paper, we examine two multi-agent based representations of SATs and further experimentally study the topologies of resulting agent networks. We show that different repres...
126
click to vote
IMR
1998
Springer
15 years 6 months ago
1998
Springer
High reynolds number ow simulations exhibit strong gradients normal to walls and across shear layers requiring much ner resolution of the solution in some directions compared to o...
160
click to vote
HYBRID
2000
Springer
15 years 6 months ago
2000
Springer
Abstract. We define a new class of hybrid automata for which reachability is decidable--a proper superclass of the initialized rectangular hybrid automata--by taking parallel compo...