Sciweavers

27 search results - page 3 / 6
» Continuously-adaptive discretization for message-passing alg...
Sort
View
100
Voted
PAMI
2010
168views more  PAMI 2010»
14 years 8 months ago
Dynamic Hybrid Algorithms for MAP Inference in Discrete MRFs
—In this paper, we present novel techniques that improve the computational and memory efficiency of algorithms for solving multi-label energy functions arising from discrete MRF...
Karteek Alahari, Pushmeet Kohli, Philip H. S. Torr
88
Voted
ECCV
2006
Springer
16 years 4 days ago
Comparison of Energy Minimization Algorithms for Highly Connected Graphs
Algorithms for discrete energy minimization play a fundamental role for low-level vision. Known techniques include graph cuts, belief propagation (BP) and recently introduced tree-...
Vladimir Kolmogorov, Carsten Rother
81
Voted
SIGECOM
2004
ACM
134views ECommerce» more  SIGECOM 2004»
15 years 3 months ago
Computing approximate bayes-nash equilibria in tree-games of incomplete information
We provide efficient algorithms for finding approximate BayesNash equilibria (BNE) in graphical, specifically tree, games of incomplete information. In such games an agent’s p...
Satinder P. Singh, Vishal Soni, Michael P. Wellman
WSC
2007
15 years 17 days ago
Parallel cross-entropy optimization
The Cross-Entropy (CE) method is a modern and effective optimization method well suited to parallel implementations. There is a vast array of problems today, some of which are hig...
Gareth E. Evans, Jonathan M. Keith, Dirk P. Kroese
65
Voted
ACISICIS
2009
IEEE
15 years 1 months ago
A Parallel Algorithm for Computer Simulation of Electrocardiogram Based on MPI
—This paper presents a parallel algorithm for computer simulation of Electrocardiogram (ECG) based on a 3-dimensional (3D) whole-heart model. The computer heart model includes ap...
Wenfeng Shen, Weijia Lu, Daming Wei, Weimin Xu, Xi...