Sciweavers

3049 search results - page 302 / 610
» On the Convergence of Bound Optimization Algorithms
Sort
View
EWSN
2009
Springer
16 years 7 months ago
Solving the Wake-Up Scattering Problem Optimally
Abstract. In their EWSN'07 paper [1], Giusti et al. proposed a decentralized wake-up scattering algorithm for temporally spreading the intervals in which the nodes of a wirele...
Luigi Palopoli, Roberto Passerone, Amy L. Murphy, ...
FSTTCS
2009
Springer
16 years 1 months ago
Iterative Methods in Combinatorial Optimization
We describe a simple iterative method for proving a variety of results in combinatorial optimization. It is inspired by Jain’s iterative rounding method (FOCS 1998) for designing...
R. Ravi
CVPR
2008
IEEE
16 years 8 months ago
Interactive image segmentation via minimization of quadratic energies on directed graphs
We propose a scheme to introduce directionality in the Random Walker algorithm for image segmentation. In particular, we extend the optimization framework of this algorithm to com...
Dheeraj Singaraju, Leo Grady, René Vidal
ICPR
2010
IEEE
16 years 9 days ago
Constrained Energy Minimization for Matching-Based Image Recognition
We propose to use energy minimization in MRFs for matching-based image recognition tasks. To this end, the Tree-Reweighted Message Passing algorithm is modified by geometric cons...
Tobias Gass, Philippe Dreuw, Hermann Ney
ESA
2008
Springer
124views Algorithms» more  ESA 2008»
15 years 8 months ago
Collusion-Resistant Mechanisms with Verification Yielding Optimal Solutions
A truthful mechanism consists of an algorithm augmented with a suitable payment function which guarantees that the "players" cannot improve their utilities by "chea...
Paolo Penna, Carmine Ventre