Sciweavers

132 search results - page 20 / 27
» Axioms for Sequential Convergence
Sort
View
ECCV
2008
Springer
15 years 10 months ago
Window Annealing over Square Lattice Markov Random Field
Monte Carlo methods and their subsequent simulated annealing are able to minimize general energy functions. However, the slow convergence of simulated annealing compared with more ...
Ho Yub Jung, Kyoung Mu Lee, Sang Uk Lee
ATAL
2005
Springer
15 years 5 months ago
Theory of moves learners: towards non-myopic equilibria
In contrast to classical game theoretic analysis of simultaneous and sequential play in bimatrix games, Steven Brams has proposed an alternative framework called the Theory of Mov...
Arjita Ghosh, Sandip Sen
SC
2000
ACM
15 years 4 months ago
Parallel Smoothed Aggregation Multigrid: Aggregation Strategies on Massively Parallel Machines
Algebraic multigrid methods offer the hope that multigrid convergence can be achieved (for at least some important applications) without a great deal of effort from engineers an...
Ray S. Tuminaro, Charles Tong
CVPR
2012
IEEE
13 years 2 months ago
A tiered move-making algorithm for general pairwise MRFs
A large number of problems in computer vision can be modeled as energy minimization problems in a markov random field (MRF) framework. Many methods have been developed over the y...
Vibhav Vineet, Jonathan Warrell, Philip H. S. Torr
ICC
2009
IEEE
114views Communications» more  ICC 2009»
15 years 6 months ago
Distributed Gradient Based Gain Allocation for Coherent Multiuser AF Relaying Networks
—A set of distributed non-cooperating relay antennas is known to be capable of orthogonalizing multiple sourcedestination pairs in space by coherent amplify-and-forward (AF) rela...
Celal Esli, Jörg Wagner, Armin Wittneben