Sciweavers

1404 search results - page 122 / 281
» Optimization problems in multiple-interval graphs
Sort
View
ICCV
2009
IEEE
16 years 2 months ago
Optimizing Parametric Total Variation Models
One of the key factors for the success of recent energy minimization methods is that they seek to compute global solutions. Even for non-convex energy functionals, optimization ...
Petter Strandmark, Fredrik Kahl, Niels Chr. Overga...
CORR
2007
Springer
130views Education» more  CORR 2007»
14 years 10 months ago
Lagrangian Relaxation for MAP Estimation in Graphical Models
Abstract— We develop a general framework for MAP estimation in discrete and Gaussian graphical models using Lagrangian relaxation techniques. The key idea is to reformulate an in...
Jason K. Johnson, Dmitry M. Malioutov, Alan S. Wil...
ASPDAC
2008
ACM
93views Hardware» more  ASPDAC 2008»
14 years 12 months ago
Scheduling with integer time budgeting for low-power optimization
In this paper we present a mathematical programming formulation of the integer time budgeting problem for directed acyclic graphs. In particular, we formally prove that our constr...
Wei Jiang, Zhiru Zhang, Miodrag Potkonjak, Jason C...
STOC
2010
ACM
220views Algorithms» more  STOC 2010»
15 years 1 months ago
Combinatorial approach to the interpolation method and scaling limits in sparse random graphs
We establish the existence of free energy limits for several sparse random hypergraph models corresponding to certain combinatorial models on Erd¨os-R´enyi graph G(N, c/N) and r...
Mohsen Bayati, David Gamarnik, Prasad Tetali
AIPS
2009
14 years 11 months ago
Navigation Planning in Probabilistic Roadmaps with Uncertainty
Probabilistic Roadmaps (PRM) are a commonly used class of algorithms for robot navigation tasks where obstacles are present in the environment. We examine the situation where the ...
Michael Kneebone, Richard Dearden