3049 search results - page 524 / 610 » On the Convergence of Bound Optimization Algorithms |
CCCG
2007
13 years 10 months ago
2007
Given a sequence of n real numbers a1, a2, a3, . . . , an, the maximum segment sum problem is that of determining indices i and j (1 ≤ i ≤ j ≤ n) such that the sum s(i, j) =...
UAI
2004
13 years 10 months ago
2004
Exponential models of distributions are widely used in machine learning for classification and modelling. It is well known that they can be interpreted as maximum entropy models u...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
Grothendieck inequalities are fundamental inequalities which are frequently used in many areas of mathematics and computer science. They can be interpreted as upper bounds for the ...
IEICET
2006
13 years 8 months ago
2006
A problem of arranging n points as uniformly as possible, which is equivalent to that of packing n equal and non-overlapping circles in a unit square, is frequently asked. In this ...
ORL
2008
13 years 8 months ago
2008
This paper focuses on tractable instances of interval data minmax regret graph problems. More precisely, we provide polynomial and pseudopolynomial algorithms for sets of particul...