179 search results - page 3 / 36 » On Time Lookahead Algorithms for the Online Data Acknowledge... |
WSOM
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. We show how the “Online Sparse Coding Neural Gas” algorithm can be applied to a more realistic model of the “Cocktail Party Problem”. We consider a setting where ...
AAAI
2012
11 years 9 months ago
2012
We explore the problem of assigning heterogeneous tasks to workers with different, unknown skill sets in crowdsourcing markets such as Amazon Mechanical Turk. We first formalize ...
ESANN
2006
13 years 8 months ago
2006
Abstract. We present the OnlineDoubleMaxMinOver approach to obtain the Support Vectors in two class classification problems. With its linear time complexity and linear convergence ...
ACTA
2006
13 years 7 months ago
2006
Abstract We consider the problem of maximizing throughput in a multi-carrier wireless network that employs predictive link adaptation. We explicitly consider the time-penalty incur...
ECCC
2007
13 years 7 months ago
2007
We study the notion of learning in an oblivious changing environment. Existing online learning algorithms which minimize regret are shown to converge to the average of all locally...