3049 search results - page 463 / 610 » On the Convergence of Bound Optimization Algorithms |
150
click to vote
ESA
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. Minimizing the makespan or maximizing the minimum machine load are two of the most important and fundamental parallel machine scheduling problems. In an online scenario, ...
138
click to vote
TWC
2008
15 years 4 months ago
2008
This letter considers multiple symbol differential detection for multiple-antenna systems over flat Ricean-fading channels when partial channel state information (CSI) is available...
144
click to vote
COLT
2010
Springer
15 years 2 months ago
2010
Springer
We develop an online algorithm called Component Hedge for learning structured concept classes when the loss of a structured concept sums over its components. Example classes inclu...
167
click to vote
DLOG
2011
14 years 7 months ago
2011
Completion algorithms for subsumption are investigated for many extensions of the description logic EL. While for several of them subsumption is tractable, this is no longer the ca...
134
click to vote
SODA
2010
ACM
16 years 1 months ago
2010
ACM
We introduce the classified stable matching problem, a problem motivated by academic hiring. Suppose that a number of institutes are hiring faculty members from a pool of applican...