Sciweavers

107 search results - page 14 / 22
» General Loss Bounds for Universal Sequence Prediction
Sort
View
CODES
2007
IEEE
14 years 1 months ago
Predator: a predictable SDRAM memory controller
Memory requirements of intellectual property components (IP) in contemporary multi-processor systems-on-chip are increasing. Large high-speed external memories, such as DDR2 SDRAM...
Benny Akesson, Kees Goossens, Markus Ringhofer
STOC
2007
ACM
142views Algorithms» more  STOC 2007»
14 years 7 months ago
Lower bounds for randomized read/write stream algorithms
Motivated by the capabilities of modern storage architectures, we consider the following generalization of the data stream model where the algorithm has sequential access to multi...
Paul Beame, T. S. Jayram, Atri Rudra
JMLR
2010
121views more  JMLR 2010»
13 years 2 months ago
Sparse Semi-supervised Learning Using Conjugate Functions
In this paper, we propose a general framework for sparse semi-supervised learning, which concerns using a small portion of unlabeled data and a few labeled data to represent targe...
Shiliang Sun, John Shawe-Taylor
COLT
2006
Springer
13 years 11 months ago
Online Learning Meets Optimization in the Dual
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
ICCV
2003
IEEE
14 years 9 months ago
Controlling Model Complexity in Flow Estimation
This paper describes a novel application of Statistical Learning Theory (SLT) to control model complexity in flow estimation. SLT provides analytical generalization bounds suitabl...
Zoran Duric, Fayin Li, Harry Wechsler, Vladimir Ch...