Sciweavers

2520 search results - page 84 / 504
» The complexity of approximating entropy
Sort
View
73
Voted
EUROGP
2005
Springer
107views Optimization» more  EUROGP 2005»
15 years 3 months ago
Operator-Based Distance for Genetic Programming: Subtree Crossover Distance
Abstract. This paper explores distance measures based on genetic operators for genetic programming using tree structures. The consistency between genetic operators and distance mea...
Steven M. Gustafson, Leonardo Vanneschi
94
Voted
DSMML
2004
Springer
15 years 3 months ago
Extensions of the Informative Vector Machine
The informative vector machine (IVM) is a practical method for Gaussian process regression and classification. The IVM produces a sparse approximation to a Gaussian process by com...
Neil D. Lawrence, John C. Platt, Michael I. Jordan
120
Voted
CVPR
2006
IEEE
15 years 1 months ago
An Efficiency Criterion for 2D Shape Model Selection.
We propose efficiency of representation as a criterion for evaluating shape models, then apply this criterion to compare the boundary curve representation with the medial axis. We...
Kathryn Leonard
NIPS
2007
14 years 11 months ago
New Outer Bounds on the Marginal Polytope
We give a new class of outer bounds on the marginal polytope, and propose a cutting-plane algorithm for efficiently optimizing over these constraints. When combined with a concav...
David Sontag, Tommi Jaakkola
98
Voted
ACL
2006
14 years 11 months ago
A Hierarchical Bayesian Language Model Based On Pitman-Yor Processes
We propose a new hierarchical Bayesian n-gram model of natural languages. Our model makes use of a generalization of the commonly used Dirichlet distributions called Pitman-Yor pr...
Yee Whye Teh