3049 search results - page 136 / 610 » On the Convergence of Bound Optimization Algorithms |
163
click to vote
ISSS
2000
IEEE
15 years 9 months ago
2000
IEEE
This paper addresses the problem of estimating lower bounds on the power consumption in scheduled data flow graphs with a fixed number of allocated resources prior to binding. T...
139
click to vote
CAIP
2005
Springer
15 years 10 months ago
2005
Springer
We consider simple cube-curves in the orthogonal 3D grid. The union of all cells contained in such a curve (also called the tube of this curve) is a polyhedrally bounded set. The c...
117
click to vote
JCSS
2008
15 years 4 months ago
2008
We present a polynomial time approximation algorithm for unit time precedence constrained scheduling. Our algorithm guarantees schedules which are at most 2 - 7 3p+1 factor as lon...
127
click to vote
ECAI
2006
Springer
15 years 8 months ago
2006
Springer
AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is its sensi...
142
click to vote
ICML
2009
IEEE
16 years 5 months ago
2009
IEEE
We introduce a new algorithm for binary classification in the selective sampling protocol. Our algorithm uses Regularized Least Squares (RLS) as base classifier, and for this reas...