Sciweavers

3088 search results - page 358 / 618
» Online Passive-Aggressive Algorithms
Sort
View
NIPS
2004
15 years 8 months ago
Mistake Bounds for Maximum Entropy Discrimination
We establish a mistake bound for an ensemble method for classification based on maximizing the entropy of voting weights subject to margin constraints. The bound is the same as a ...
Philip M. Long, Xinyu Wu
SODA
2004
ACM
83views Algorithms» more  SODA 2004»
15 years 8 months ago
Caching queues in memory buffers
Motivated by the need for maintaining multiple, large queues of data in modern high-performance systems, we study the problem of caching queues in memory under the following simpl...
Rajeev Motwani, Dilys Thomas
AAAI
2000
15 years 8 months ago
Predicting Future User Actions by Observing Unmodified Applications
Intelligent user interfaces often rely on modified applications and detailed application models. Such modifications and models are expensive to build and maintain. We propose to a...
Peter Gorniak, David Poole
WSC
1997
15 years 8 months ago
Single Run Optimization Using the Reverse-Simulation Method
An efficient “Simulation Optimization” technique is developed to solve system design problems which can not be expressed in explicit analytical or mathematical models. In part...
Young Hae Lee, Kyoung Jong Park, Yun Bae Kim
ESA
2010
Springer
140views Algorithms» more  ESA 2010»
15 years 6 months ago
A Robust PTAS for Machine Covering and Packing
Abstract. Minimizing the makespan or maximizing the minimum machine load are two of the most important and fundamental parallel machine scheduling problems. In an online scenario, ...
Martin Skutella, José Verschae