Sciweavers

56 search results - page 6 / 12
» The Uniformity Conjecture
Sort
View
JMLR
2007
104views more  JMLR 2007»
13 years 10 months ago
Learnability of Gaussians with Flexible Variances
Gaussian kernels with flexible variances provide a rich family of Mercer kernels for learning algorithms. We show that the union of the unit balls of reproducing kernel Hilbert s...
Yiming Ying, Ding-Xuan Zhou
DM
2008
87views more  DM 2008»
13 years 11 months ago
More on pooling spaces
A pooling space is a ranked poset P such that the subposet w+ induced by the elements above w is atomic for each element w of P. Pooling spaces were introduced in [Discrete Mathem...
Hau-wen Huang, Yu-pei Huang, Chih-wen Weng
APPROX
2010
Springer
148views Algorithms» more  APPROX 2010»
14 years 12 days ago
Learning and Lower Bounds for AC0 with Threshold Gates
In 2002 Jackson et al. [JKS02] asked whether AC0 circuits augmented with a threshold gate at the output can be efficiently learned from uniform random examples. We answer this ques...
Parikshit Gopalan, Rocco A. Servedio
NPC
2010
Springer
13 years 9 months ago
Differentiated Replication Strategy in Data Centers
Cloud computing has attracted a great deal of attention in both academia and industry. We envision the provision of differentiated services as being one of the key components to th...
Tung Nguyen, Anthony Cutway, Weisong Shi
CORR
2010
Springer
162views Education» more  CORR 2010»
13 years 11 months ago
Random sampling of lattice paths with constraints, via transportation
We investigate Monte Carlo Markov Chain (MCMC) procedures for the random sampling of some one-dimensional lattice paths with constraints, for various constraints. We will see that...
Lucas Gerin