Sciweavers

269 search results - page 23 / 54
» The Quantitative Structure of Exponential Time
Sort
View
FOCS
2007
IEEE
14 years 2 months ago
Can you beat treewidth?
: It is well-known that constraint satisfaction problems (CSP) over an unbounded domain can be solved in time nO(k) if the treewidth of the primal graph of the instance is at most ...
Dániel Marx
CVPR
2008
IEEE
14 years 9 months ago
Drift-free tracking of rigid and articulated objects
Model-based 3D tracker estimate the position, rotation, and joint angles of a given model from video data of one or multiple cameras. They often rely on image features that are tr...
Juergen Gall, Bodo Rosenhahn, Hans-Peter Seidel
WIA
2009
Springer
14 years 2 months ago
Implementation of State Elimination Using Heuristics
Abstract. State elimination is an intuitive and easy-to-implement algorithm that computes a regular expression from a finite-state automaton (FA). The size of a regular expression...
Jae-Hee Ahn, Yo-Sub Han
ECAI
2006
Springer
13 years 11 months ago
Dynamic Orderings for AND/OR Branch-and-Bound Search in Graphical Models
AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is its sensi...
Radu Marinescu 0002, Rina Dechter
NIPS
2008
13 years 9 months ago
Continuously-adaptive discretization for message-passing algorithms
Continuously-Adaptive Discretization for Message-Passing (CAD-MP) is a new message-passing algorithm for approximate inference. Most message-passing algorithms approximate continu...
Michael Isard, John MacCormick, Kannan Achan