Sciweavers

535 search results - page 23 / 107
» Online learning over graphs
Sort
View
COMPGEOM
1992
ACM
13 years 11 months ago
On-Line Steiner Trees in the Euclidean Plane
Suppose we are given a sequence of n points in the Euclidean plane, and our objective is to construct, on-line, a connected graph that connects all of them, trying to minimize the...
Noga Alon, Yossi Azar
CORR
2010
Springer
107views Education» more  CORR 2010»
13 years 6 months ago
Distributed Detection over Time Varying Networks: Large Deviations Analysis
—We apply large deviations theory to study asymptotic performance of running consensus distributed detection in sensor networks. Running consensus is a stochastic approximation t...
Dragana Bajovic, Dusan Jakovetic, João Xavi...
HIS
2008
13 years 9 months ago
Neural Plasticity and Minimal Topologies for Reward-Based Learning
Artificial Neural Networks for online learning problems are often implemented with synaptic plasticity to achieve adaptive behaviour. A common problem is that the overall learning...
Andrea Soltoggio
IJET
2007
214views more  IJET 2007»
13 years 7 months ago
Employing Collaborative Learning Strategies in Online Conflict Resolution
—Although some critics may argue that conflict resolution cannot be carried out appropriately by virtual education, the basic elements of conflict present themselves within dista...
Samir Abou El-Seoud, Carme Anguera Iglesias, Marga...
SDM
2008
SIAM
140views Data Mining» more  SDM 2008»
13 years 9 months ago
Large-Scale Many-Class Learning
In many multiclass learning scenarios, the number of classes is relatively large (thousands,...), or the space and time efficiency of the learning system can be crucial. We invest...
Omid Madani, Michael Connor