Sciweavers

672 search results - page 99 / 135
» A General Solution to the Graph History Interaction Problem
Sort
View
ICCV
2009
IEEE
14 years 12 months ago
The Swap and Expansion Moves Revisited and Fused
Many solutions to computer vision and image processing problems involve the minimization of multi-label energy functions with up to K variables in each term. In the minimization pr...
Ido Leichter
EMMCVPR
2001
Springer
14 years 1 months ago
A Double-Loop Algorithm to Minimize the Bethe Free Energy
Recent work (Yedidia, Freeman, Weiss [22]) has shown that stable points of belief propagation (BP) algorithms [12] for graphs with loops correspond to extrema of the Bethe free ene...
Alan L. Yuille
SIAMJO
2008
66views more  SIAMJO 2008»
13 years 8 months ago
Further Relaxations of the Semidefinite Programming Approach to Sensor Network Localization
Recently, a semidefinite programming (SDP) relaxation approach has been proposed to solve the sensor network localization problem. Although it achieves high accuracy in estimating ...
Zizhuo Wang, Song Zheng, Yinyu Ye, Stephen Boyd
4OR
2010
148views more  4OR 2010»
13 years 7 months ago
Point-to-point shortest paths on dynamic time-dependent road networks
This a summary of the author's PhD thesis supervised by Leo Liberti, Philippe Baptiste and Daniel Krob and defended on 18 June 2009 at Ecole Polytechnique, Palaiseau, France. ...
Giacomo Nannicini
ICDM
2009
IEEE
152views Data Mining» more  ICDM 2009»
13 years 6 months ago
A Sparsification Approach for Temporal Graphical Model Decomposition
Temporal causal modeling can be used to recover the causal structure among a group of relevant time series variables. Several methods have been developed to explicitly construct te...
Ning Ruan, Ruoming Jin, Victor E. Lee, Kun Huang