11910 search results - page 90 / 2382 » Online Learning Algorithms |
100
click to vote
CORR
2004
Springer
15 years 12 days ago
2004
Springer
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...
115
click to vote
IPSN
2004
Springer
15 years 6 months ago
2004
Springer
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, ...
93
Voted
WWW
2007
ACM
16 years 1 months ago
2007
ACM
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...
69
Voted
ETS
2007
IEEE
15 years 15 days ago
2007
IEEE
120
Voted
SDM
2003
SIAM
15 years 1 months ago
2003
SIAM
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 ...