1199 search results - page 141 / 240 » Parameterized Proof Complexity |
149
click to vote
GRAPHITE
2007
ACM
15 years 4 months ago
2007
ACM
Because of their geometric complexity, high resolution 3D models, either designed in high-end modeling packages or acquired with range scanning devices, cannot be directly used in...
122
Voted
SIGGRAPH
2000
ACM
15 years 4 months ago
2000
ACM
Our goal is to embed free-form constraints into a graphical model. With such constraints a graphic can maintain its visual integrity--and break rules tastefully--while being manip...
107
Voted
PAMI
2010
14 years 11 months ago
2010
In this paper, we address the tasks of detecting, segmenting, parsing, and matching deformable objects. We use a novel probabilistic object model that we call a hierarchical defor...
90
Voted
AUSAI
2007
Springer
15 years 6 months ago
2007
Springer
In this paper we show how to capture dialogue games in Defeasible Logic. We argue that Defeasible Logic is a natural candidate and general representation formalism to capture dialo...
172
Voted
ILC
2007
Springer
15 years 6 months ago
2007
Springer
Two-way alternating automata were introduced by Vardi in order to study the satisfiability problem for the modal µ-calculus extended with backwards modalities. In this paper, we ...