3049 search results - page 68 / 610 » On the Convergence of Bound Optimization Algorithms |
136
click to vote
HPCC
2005
Springer
15 years 9 months ago
2005
Springer
With the multicast technology, demands for the real-time group applications through multicasting is getting more important. An essential factor of these real-time strategy is to op...
124
click to vote
DAGSTUHL
2004
15 years 5 months ago
2004
We study the optimal approximation of the solution of an operator equation A(u) = f by four types of mappings: a) linear mappings of rank n; b) n-term approximation with respect t...
145
click to vote
JC
2006
15 years 4 months ago
2006
We study the optimal approximation of the solution of an operator equation A(u) = f by four types of mappings: a) linear mappings of rank n; b) n-term approximation with respect t...
115
click to vote
ADCM
2010
15 years 4 months ago
2010
Sampling inequalities give a precise formulation of the fact that a differentiable function cannot attain large values, if its derivatives are bounded and if it is small on a suff...
141
click to vote
SODA
2010
ACM
16 years 1 months ago
2010
ACM
Finding the largest independent set in a graph is a notoriously difficult NP-complete combinatorial optimization problem. Moreover, even for graphs with largest degree 3, no polyn...