697 search results - page 31 / 140 » Convex Functions on Discrete Sets |
JMLR
2010
13 years 3 months ago
2010
Virtually all methods of learning dynamic systems from data start from the same basic assumption: the learning algorithm will be given a sequence of data generated from the dynami...
UAI
2008
13 years 10 months ago
2008
Inference problems in graphical models can be represented as a constrained optimization of a free energy function. It is known that when the Bethe free energy is used, the fixedpo...
PG
2003
IEEE
14 years 2 months ago
2003
IEEE
We present an algorithm to construct a tight bounding polyhedron for a recursive procedural model. We first use an iterated function system (IFS) to represent the extent of the p...
ALT
2004
Springer
14 years 5 months ago
2004
Springer
The decomposition method is currently one of the major methods for solving the convex quadratic optimization problems being associated with support vector machines. For a special c...
EOR
2002
13 years 8 months ago
2002
Let F be a subset of the n-dimensional Euclidean space Rn represented in terms of a compact convex subset C0 and a set PF of nitely or in nitely many quadratic functions on Rn such...