Sciweavers

356 search results - page 27 / 72
» Revisiting the Paxos Algorithm
Sort
View
ICCV
2009
IEEE
13 years 5 months ago
An algorithm for minimizing the Mumford-Shah functional
In this work we revisit the Mumford-Shah functional, one of the most studied variational approaches to image segmentation. The contribution of this paper is to propose an algorith...
Thomas Pock, Daniel Cremers, Horst Bischof, Antoni...
JMLR
2010
118views more  JMLR 2010»
13 years 2 months ago
Exploiting Within-Clique Factorizations in Junction-Tree Algorithms
It is probably fair to say that exact inference in graphical models is considered a solved problem, at least regarding its computational complexity: it is exponential in the treew...
Julian John McAuley, Tibério S. Caetano
CASC
2011
Springer
262views Mathematics» more  CASC 2011»
12 years 7 months ago
Practical Divide-and-Conquer Algorithms for Polynomial Arithmetic
We investigate two practical divide-and-conquer style algorithms for univariate polynomial arithmetic. First we revisit an algorithm originally described by Brent and Kung for comp...
William Hart, Andrew Novocin
ICCV
2009
IEEE
15 years 11 days ago
An Algorithm for Minimizing the Piecewise Smooth Mumford-Shah Functional
In this work we revisit the Mumford-Shah functional, one of the most studied variational approaches to image segmentation. The contribution of this paper is to propose an algori...
Thomas Pock, Daniel Cremers, Horst Bischof, Antoni...
ICPR
2008
IEEE
14 years 8 months ago
An empirical comparison of graph-based dimensionality reduction algorithms on facial expression recognition tasks
Facial expression recognition is a topic of interest both in industry and academia. Recent approaches to facial expression recognition are based on mapping expressions to low dime...
José Miguel Buenaposada, Li He, Luis Baumel...