Sciweavers

681 search results - page 83 / 137
» et 2006
Sort
View
CORR
2006
Springer
91views Education» more  CORR 2006»
14 years 9 months ago
Improved results for a memory allocation problem
We consider a memory allocation problem. This problem can be modeled as a version of bin packing where items may be split, but each bin may contain at most two (parts of) items. T...
Leah Epstein, Rob van Stee
CORR
2006
Springer
96views Education» more  CORR 2006»
14 years 9 months ago
Metric entropy in competitive on-line prediction
Competitive on-line prediction (also known as universal prediction of individual sequences) is a strand of learning theory avoiding making any stochastic assumptions about the way...
Vladimir Vovk
CORR
2006
Springer
99views Education» more  CORR 2006»
14 years 9 months ago
PAC Learning Mixtures of Axis-Aligned Gaussians with No Separation Assumption
Abstract. We propose and analyze a new vantage point for the learning of mixtures of Gaussians: namely, the PAC-style model of learning probability distributions introduced by Kear...
Jon Feldman, Ryan O'Donnell, Rocco A. Servedio
CORR
2006
Springer
122views Education» more  CORR 2006»
14 years 9 months ago
Derivatives of Entropy Rate in Special Families of Hidden Markov Chains
Consider a hidden Markov chain obtained as the observation process of an ordinary Markov chain corrupted by noise. Zuk, et. al. [13, 14] showed how, in principle, one can explicit...
Guangyue Han, Brian Marcus
CSDA
2006
117views more  CSDA 2006»
14 years 9 months ago
GACV for quantile smoothing splines
Quantile smoothing splines provide nonparametric estimation of conditional quantile functions. Like other nonparametric smoothing techniques, the choice of smoothing parameters co...
Ming Yuan