Sciweavers

14 search results - page 2 / 3
» Hybrid tractable CSPs which generalize tree structure
Sort
View
CIAC
2010
Springer
232views Algorithms» more  CIAC 2010»
13 years 8 months ago
Multicut Algorithms via Tree Decompositions
Various forms of multicut problems are of great importance in the area of network design. In general, these problems are intractable. However, several parameters have been identifi...
Reinhard Pichler, Stefan Rümmele, Stefan Woltran
IANDC
2008
112views more  IANDC 2008»
13 years 4 months ago
Inclusion dynamics hybrid automata
Hybrid systems are dynamical systems with the ability to describe mixed discretecontinuous evolution of a wide range of systems. Consequently, at first glance, hybrid systems appe...
Alberto Casagrande, Carla Piazza, Alberto Policrit...
UAI
1997
13 years 6 months ago
Nonuniform Dynamic Discretization in Hybrid Networks
We consider probabilistic inference in general hybrid networks, which include continuous and discrete variables in an arbitrary topology. We reexamine the question of variable dis...
Alexander V. Kozlov, Daphne Koller
PODS
2007
ACM
171views Database» more  PODS 2007»
14 years 5 months ago
Monadic datalog over finite structures with bounded treewidth
Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we ...
Georg Gottlob, Reinhard Pichler, Fang Wei
JMLR
2012
11 years 7 months ago
Low rank continuous-space graphical models
Constructing tractable dependent probability distributions over structured continuous random vectors is a central problem in statistics and machine learning. It has proven diffic...
Carl Smith, Frank Wood, Liam Paninski