Sciweavers

5214 search results - page 67 / 1043
» The Online Specialization Problem
Sort
View
ML
2007
ACM
131views Machine Learning» more  ML 2007»
13 years 7 months ago
A primal-dual perspective of online learning algorithms
We describe a novel framework for the design and analysis of online learning algorithms based on the notion of duality in constrained optimization. We cast a sub-family of universa...
Shai Shalev-Shwartz, Yoram Singer
ICCAD
2009
IEEE
82views Hardware» more  ICCAD 2009»
13 years 5 months ago
Operating system scheduling for efficient online self-test in robust systems
Very thorough online self-test is essential for overcoming major reliability challenges such as early-life failures and transistor aging in advanced technologies. This paper demon...
Yanjing Li, Onur Mutlu, Subhasish Mitra
COLT
2008
Springer
13 years 9 months ago
Competing in the Dark: An Efficient Algorithm for Bandit Linear Optimization
We introduce an efficient algorithm for the problem of online linear optimization in the bandit setting which achieves the optimal O ( T) regret. The setting is a natural general...
Jacob Abernethy, Elad Hazan, Alexander Rakhlin
SIGCSE
1998
ACM
84views Education» more  SIGCSE 1998»
13 years 12 months ago
Integrating technology into computer science examinations
On-line programming tests and examinations were administered to approximately 120 first year computer science students in order to evaluate their practical skills. We describe ou...
David V. Mason, Denise M. Woit
ECIR
2003
Springer
13 years 9 months ago
Attaining Fast and Successful Searches in E-commerce Environments
Current online stores suffer from a cardinal problem. There are too many products to offer, and customers find themselves lost due to the vast selection. As opposed to traditional ...
Raz Lin, Sarit Kraus, Jeffrey D. Tew