Sciweavers

11910 search results - page 90 / 2382
» Online Learning Algorithms
Sort
View
CORR
2004
Springer
103views Education» more  CORR 2004»
15 years 2 months ago
Online convex optimization in the bandit setting: gradient descent without a gradient
We study a general online convex optimization problem. We have a convex set S and an unknown sequence of cost functions c1, c2, . . . , and in each period, we choose a feasible po...
Abraham Flaxman, Adam Tauman Kalai, H. Brendan McM...
IPSN
2004
Springer
15 years 8 months ago
Distributed online localization in sensor networks using a moving target
We describe a novel method for node localization in a sensor network where there are a fraction of reference nodes with known locations. For application-specific sensor networks, ...
Aram Galstyan, Bhaskar Krishnamachari, Kristina Le...
WWW
2007
ACM
16 years 3 months ago
Summarization of online image collections via implicit feedback
The availability of map interfaces and location-aware devices makes a growing amount of unstructured, geo-referenced information available on the Web. In particular, over twelve m...
Shane Ahern, Simon King, Mor Naaman, Rahul Nair
SDM
2003
SIAM
123views Data Mining» more  SDM 2003»
15 years 4 months ago
Fast Online SVD Revisions for Lightweight Recommender Systems
The singular value decomposition (SVD) is fundamental to many data modeling/mining algorithms, but SVD algorithms typically have quadratic complexity and require random access to ...
Matthew Brand