Sciweavers

3049 search results - page 581 / 610
» On the Convergence of Bound Optimization Algorithms
Sort
View
WINE
2010
Springer
251views Economy» more  WINE 2010»
13 years 6 months ago
The Complexity of Equilibria in Cost Sharing Games
We study Congestion Games with non-increasing cost functions (Cost Sharing Games) from a complexity perspective and resolve their computational hardness, which has been an open que...
Vasilis Syrgkanis
COR
2011
13 years 3 months ago
MIP models for connected facility location: A theoretical and computational study
This article comprises the first theoretical and computational study on mixed integer programming (MIP) models for the connected facility location problem (ConFL). ConFL combines...
Stefan Gollowitzer, Ivana Ljubic
ICCV
2011
IEEE
12 years 8 months ago
Strong Supervision From Weak Annotation: Interactive Training of Deformable Part Models
We propose a framework for large scale learning and annotation of structured models. The system interleaves interactive labeling (where the current model is used to semiautomate t...
Steven Branson, Pietro Perona, Serge Belongie
IJCV
2008
282views more  IJCV 2008»
15 years 1 months ago
Stereo Matching Using Population-Based MCMC
In this paper, we propose a new stereo matching method using the population-based Markov Chain Monte Carlo (Pop-MCMC), which belongs to the sampling-based methods. Since the previo...
Wonsik Kim (Seoul National University), Joonyoung ...
CVPR
2005
IEEE
14 years 10 months ago
Local Color Transfer via Probabilistic Segmentation by Expectation-Maximization
We address the problem of regional color transfer between two natural images by probabilistic segmentation. We use a new Expectation-Maximization (EM) scheme to impose both spatia...
Yu-Wing Tai, Jiaya Jia, Chi-Keung Tang