Sciweavers

945 search results - page 48 / 189
» Dialog Convergence and Learning
Sort
View
CORR
2010
Springer
104views Education» more  CORR 2010»
14 years 9 months ago
Decentralised Learning MACs for Collision-free Access in WLANs
By combining the features of CSMA and TDMA, fully decentralised WLAN MAC schemes have recently been proposed that converge to collision-free schedules. In this paper we describe a ...
Minyu Fang, David Malone, Ken R. Duffy, Douglas J....
CORR
2010
Springer
165views Education» more  CORR 2010»
14 years 9 months ago
Online Learning: Beyond Regret
We study online learnability of a wide class of problems, extending the results of [26] to general notions of performance measure well beyond external regret. Our framework simult...
Alexander Rakhlin, Karthik Sridharan, Ambuj Tewari
TSMC
2002
102views more  TSMC 2002»
14 years 9 months ago
Generalized pursuit learning schemes: new families of continuous and discretized learning automata
The fastest learning automata (LA) algorithms currently available fall in the family of estimator algorithms introduced by Thathachar and Sastry [24]. The pioneering work of these ...
M. Agache, B. John Oommen
ICML
2007
IEEE
15 years 10 months ago
Approximate maximum margin algorithms with rules controlled by the number of mistakes
We present a family of incremental Perceptron-like algorithms (PLAs) with margin in which both the "effective" learning rate, defined as the ratio of the learning rate t...
Petroula Tsampouka, John Shawe-Taylor
COLT
2005
Springer
15 years 3 months ago
Towards a Theoretical Foundation for Laplacian-Based Manifold Methods
In recent years manifold methods have attracted a considerable amount of attention in machine learning. However most algorithms in that class may be termed “manifold-motivatedâ€...
Mikhail Belkin, Partha Niyogi