1450 search results - page 43 / 290 » Complexity of Inference in Graphical Models |
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Abstract--Interior-point methods are state-of-the-art algorithms for solving linear programming (LP) problems with polynomial complexity. Specifically, the Karmarkar algorithm typi...
ATAL
2005
Springer
14 years 1 months ago
2005
Springer
This paper presents an agent strategy for complex bilateral negotiations over many issues with inter-dependent valuations. We use ideas inspired by graph theory and probabilistic ...
CGI
2004
IEEE
13 years 11 months ago
2004
IEEE
In this paper, we present a versatile and robust model for geometrically complex deformable solids. Our approach can be applied to deformable tetrahedral meshes and to deformable ...
ICML
2010
IEEE
13 years 8 months ago
2010
IEEE
Approximate MAP inference in graphical models is an important and challenging problem for many domains including computer vision, computational biology and natural language unders...
CGI
2004
IEEE
13 years 11 months ago
2004
IEEE
Computer-aided design (CAD) and 3D visualization techniques are at the heart of many engineering processes such as aircraft, ship, and automobile design. These visualization tasks...