Sciweavers

3049 search results - page 326 / 610
» On the Convergence of Bound Optimization Algorithms
Sort
View
PKDD
2010
Springer
152views Data Mining» more  PKDD 2010»
15 years 5 months ago
Online Knowledge-Based Support Vector Machines
Prior knowledge, in the form of simple advice rules, can greatly speed up convergence in learning algorithms. Online learning methods predict the label of the current point and the...
Gautam Kunapuli, Kristin P. Bennett, Amina Shabbee...
TCOM
2010
83views more  TCOM 2010»
15 years 5 months ago
Average power reduction for MSM optical signals via sparsity and uncertainty principle
Multiple subcarrier modulation is an appealing scheme for high-data rate optical communication. However a major drawback is its low average power efficiency. While subcarrier res...
Jovana Ilic, Thomas Strohmer
CORR
2008
Springer
122views Education» more  CORR 2008»
15 years 6 months ago
Strategy Improvement for Concurrent Safety Games
We consider concurrent games played on graphs. At every round of the game, each player simultaneously and independently selects a move; the moves jointly determine the transition ...
Krishnendu Chatterjee, Luca de Alfaro, Thomas A. H...
TALG
2010
123views more  TALG 2010»
15 years 5 months ago
Lower-bounded facility location
We study the lower-bounded facility location problem, which generalizes the classical uncapacitated facility location problem in that it comes with lower bound constraints for the...
Zoya Svitkina
ICALP
2011
Springer
14 years 10 months ago
On the Advice Complexity of the k-Server Problem
Competitive analysis is the established tool for measuring the output quality of algorithms that work in an online environment. Recently, the model of advice complexity has been in...
Hans-Joachim Böckenhauer, Dennis Komm, Rastis...