Sciweavers

68 search results - page 7 / 14
» Grounding with Bounds
Sort
View
PUK
2000
13 years 9 months ago
Heuristic Search Planning with BDDs
Abstract. In this paper we study traditional and enhanced BDDbased exploration procedures capable of handling large planning problems. On the one hand, reachability analysis and mo...
Stefan Edelkamp
CORR
2010
Springer
88views Education» more  CORR 2010»
13 years 7 months ago
Grothendieck inequalities for semidefinite programs with rank constraint
Grothendieck inequalities are fundamental inequalities which are frequently used in many areas of mathematics and computer science. They can be interpreted as upper bounds for the ...
Jop Briët, Fernando Mário de Oliveira ...
JAR
2007
142views more  JAR 2007»
13 years 7 months ago
Reasoning in Description Logics by a Reduction to Disjunctive Datalog
As applications of description logics proliferate, efficient reasoning with knowledge bases containing many assertions becomes ever more important. For such cases, we developed a n...
Ullrich Hustadt, Boris Motik, Ulrike Sattler
CORR
2011
Springer
188views Education» more  CORR 2011»
13 years 2 months ago
Planar Cycle Covering Graphs
We describe a new variational lower-bound on the minimum energy configuration of a planar binary Markov Random Field (MRF). Our method is based on adding auxiliary nodes to every...
Julian Yarkony, Alexander T. Ihler, Charless C. Fo...
CVPR
2001
IEEE
14 years 9 months ago
Tracking and Modeling Non-Rigid Objects with Rank Constraints
This paper presents a novel solution for flow-based tracking and 3D reconstruction of deforming objects in monocular image sequences. A non-rigid 3D object undergoing rotation and...
Lorenzo Torresani, Danny B. Yang, Eugene J. Alexan...