Sciweavers

835 search results - page 157 / 167
» Adaptive Bound Optimization for Online Convex Optimization
Sort
View
ECCV
2008
Springer
14 years 9 months ago
Compressive Sensing for Background Subtraction
Abstract. Compressive sensing (CS) is an emerging field that provides a framework for image recovery using sub-Nyquist sampling rates. The CS theory shows that a signal can be reco...
Volkan Cevher, Aswin C. Sankaranarayanan, Marco F....
ECAI
2006
Springer
13 years 11 months ago
A Real Generalization of Discrete AdaBoost
Scaling discrete AdaBoost to handle real-valued weak hypotheses has often been done under the auspices of convex optimization, but little is generally known from the original boost...
Richard Nock, Frank Nielsen
ATAL
2008
Springer
13 years 9 months ago
A few good agents: multi-agent social learning
In this paper, we investigate multi-agent learning (MAL) in a multi-agent resource selection problem (MARS) in which a large group of agents are competing for common resources. Si...
Jean Oh, Stephen F. Smith
SPAA
2004
ACM
14 years 1 months ago
Fighting against two adversaries: page migration in dynamic networks
Page migration is one of the fundamental subproblems in the framework of data management in networks. It occurs in a distributed network of processors sharing one indivisible memo...
Marcin Bienkowski, Miroslaw Korzeniowski, Friedhel...
SPAA
2003
ACM
14 years 27 days ago
Information gathering in adversarial systems: lines and cycles
In this paper we consider the problem of routing packets to a single destination in a dynamically changing network, where both the network and the packet injections are under adve...
Kishore Kothapalli, Christian Scheideler