Sciweavers

394 search results - page 30 / 79
» A framework for evolutionary optimization with approximate f...
Sort
View
CVPR
2009
IEEE
15 years 4 months ago
Alphabet SOUP: A Framework for Approximate Energy Minimization
Many problems in computer vision can be modeled using conditional Markov random fields (CRF). Since finding the maximum a posteriori (MAP) solution in such models is NP-hard, mu...
Stephen Gould (Stanford University), Fernando Amat...
IPMI
2007
Springer
14 years 9 months ago
Active Mean Fields: Solving the Mean Field Approximation in the Level Set Framework
Abstract. We describe a new approach for estimating the posterior probability of tissue labels. Conventional likelihood models are combined with a curve length prior on boundaries,...
Kilian M. Pohl, Ron Kikinis, William M. Wells III
NIPS
2004
13 years 10 months ago
Learning Gaussian Process Kernels via Hierarchical Bayes
We present a novel method for learning with Gaussian process regression in a hierarchical Bayesian framework. In a first step, kernel matrices on a fixed set of input points are l...
Anton Schwaighofer, Volker Tresp, Kai Yu
GECCO
2006
Springer
213views Optimization» more  GECCO 2006»
14 years 19 days ago
Evolutionary unit testing of object-oriented software using strongly-typed genetic programming
Evolutionary algorithms have successfully been applied to software testing. Not only approaches that search for numeric test data for procedural test objects have been investigate...
Stefan Wappler, Joachim Wegener
INFOCOM
2010
IEEE
13 years 7 months ago
Markov Approximation for Combinatorial Network Optimization
—Many important network design problems can be formulated as a combinatorial optimization problem. A large number of such problems, however, cannot readily be tackled by distribu...
Minghua Chen, Soung Chang Liew, Ziyu Shao, Caihong...