3221 search results - page 63 / 645 » Termination of Linear Programs |
CORR
2008
Springer
13 years 8 months ago
2008
Springer
Abstract-- Interior-point algorithms constitute a very interesting class of algorithms for solving linear-programming problems. In this paper we study efficient implementations of ...
JMLR
2006
13 years 7 months ago
2006
We consider an optimization problem in probabilistic inference: Given n hypotheses Hj, m possible observations Ok, their conditional probabilities pk j, and a particular Ok, selec...
PAMI
2006
13 years 7 months ago
2006
A binary linear programming formulation of the graph edit distance for unweighted, undirected graphs with vertex attributes is derived and applied to a graph recognition problem. ...
CANDC
2005
ACM
13 years 7 months ago
2005
ACM
The task of the quartet puzzling problem is to find a best-fitting binary X-tree for a finite n-set from confidence values for the 3 n 4 binary trees with exactly four leaves from...
IPCO
2010
13 years 6 months ago
2010
In the classical secretary problem an employer would like to choose the best candidate among