Sciweavers

11910 search results - page 121 / 2382
» Online Learning Algorithms
Sort
View
COLT
2010
Springer
14 years 10 months ago
Convex Games in Banach Spaces
We study the regret of an online learner playing a multi-round game in a Banach space B against an adversary that plays a convex function at each round. We characterize the minima...
Karthik Sridharan, Ambuj Tewari
112
Voted
ECCV
2008
Springer
16 years 2 months ago
Robust Visual Tracking Based on an Effective Appearance Model
Most existing appearance models for visual tracking usually construct a pixel-based representation of object appearance so that they are incapable of fully capturing both global an...
Xi Li, Weiming Hu, Zhongfei Zhang, Xiaoqin Zhang
TMC
2008
123views more  TMC 2008»
15 years 15 days ago
Learning Adaptive Temporal Radio Maps for Signal-Strength-Based Location Estimation
In wireless networks, a client's locations can be estimated using signal strength received from signal transmitters. Static fingerprint-based techniques are commonly used for ...
Jie Yin, Qiang Yang, Lionel M. Ni
CE
2004
88views more  CE 2004»
15 years 14 days ago
Beyond formal learning: Informal community eLearning
The goal of the study described in this paper was to gain an improved understanding of the social context of UK online centres and issues around the creation and exchange of knowl...
John Cook, Matt Smith
INFOCOM
2000
IEEE
15 years 5 months ago
Efficient Handoff Rerouting Algorithms: A Competitive On-Line Algorithmic Approach
—This paper considers the design of handoff rerouting algorithms for reducing the overall session cost in personal communication systems (PCS). Most modern communication systems ...
Yigal Bejerano, Israel Cidon, Joseph Naor