Sciweavers

5214 search results - page 136 / 1043
» The Online Specialization Problem
Sort
View
COLT
2006
Springer
14 years 1 months ago
Online Tracking of Linear Subspaces
We address the problem of online de-noising a stream of input points. We assume that the clean data is embedded in a linear subspace. We present two online algorithms for tracking ...
Koby Crammer
AAAI
2007
14 years 15 days ago
An Ironing-Based Approach to Adaptive Online Mechanism Design in Single-Valued Domains
Online mechanism design considers the problem of sequential decision making in a multi-agent system with self-interested agents. The agent population is dynamic and each agent has...
David C. Parkes, Quang Duong
ADHOC
2007
107views more  ADHOC 2007»
13 years 10 months ago
On-line disjoint path routing for network capacity maximization in energy-constrained ad hoc networks
In this paper we consider on-line disjoint path routing in energy-constrained ad hoc networks. The objective is to maximize the network capacity, i.e. maximize the number of messa...
Weifa Liang, Yuzhen Liu
ETS
2000
IEEE
126views Hardware» more  ETS 2000»
13 years 10 months ago
Different (Key)strokes for Different Folks: Designing online venues for professional communities
Educational on-line resources are expanding in their application beyond delivering courses to providing venues in which members of professional communities of practice meet to exc...
Liwana S. Bringelson, Tom Carey
CORR
2010
Springer
101views Education» more  CORR 2010»
13 years 9 months ago
Online Learning: Random Averages, Combinatorial Parameters, and Learnability
We develop a theory of online learning by defining several complexity measures. Among them are analogues of Rademacher complexity, covering numbers and fatshattering dimension fro...
Alexander Rakhlin, Karthik Sridharan, Ambuj Tewari