Sciweavers

11565 search results - page 173 / 2313
» Computing Minimal Mappings
Sort
View
CISS
2010
IEEE
14 years 8 months ago
Unconstrained minimization of quadratic functions via min-sum
—Gaussian belief propagation is an iterative algorithm for computing the mean of a multivariate Gaussian distribution. Equivalently, the min-sum algorithm can be used to compute ...
Nicholas Ruozzi, Sekhar Tatikonda
AAAI
2012
13 years 6 months ago
Generalized Sampling and Variance in Counterfactual Regret Minimization
In large extensive form games with imperfect information, Counterfactual Regret Minimization (CFR) is a popular, iterative algorithm for computing approximate Nash equilibria. Whi...
Richard G. Gibson, Marc Lanctot, Neil Burch, Duane...
DAM
2011
14 years 11 months ago
On minimal Sturmian partial words
Partial words, which are sequences that may have some undefined positions called holes, can be viewed as sequences over an extended alphabet A = A ∪ { }, where stands for a hol...
Francine Blanchet-Sadri, John Lensmire
ISBI
2008
IEEE
16 years 5 months ago
Quantitative genetic modeling of lateral ventricular shape and volume using multi-atlas fluid image alignment in twins
Despite substantial progress in measuring the 3D profile of anatomical variations in the human brain, their genetic and environmental causes remain enigmatic. We developed an auto...
Yi-Yu Chou, Natasha Lepore, Marina Barysheva, Ming...
ISSAC
1998
Springer
101views Mathematics» more  ISSAC 1998»
15 years 8 months ago
Efficient Algorithms for Computing the Nearest Polynomial with Constrained Roots
Continuous changes of the coefficients of a polynomial move the roots continuously. We consider the problem finding the minimal perturbations to the coefficients to move a root to...
Markus A. Hitz, Erich Kaltofen