Sciweavers

210 search results - page 16 / 42
» Uniform regular enumerations
Sort
View
NIPS
2008
13 years 8 months ago
On the Complexity of Linear Prediction: Risk Bounds, Margin Bounds, and Regularization
This work characterizes the generalization ability of algorithms whose predictions are linear in the input vector. To this end, we provide sharp bounds for Rademacher and Gaussian...
Sham M. Kakade, Karthik Sridharan, Ambuj Tewari
FSS
2006
102views more  FSS 2006»
13 years 7 months ago
Consistent Sobolev regression via fuzzy systems with overlapping concepts
In this paper we propose a new nonparametric regression algorithm based on Fuzzy systems with overlapping concepts. We analyze its consistency properties, showing that it is capab...
Giancarlo Ferrari-Trecate, Riccardo Rovatti
IPCO
2007
126views Optimization» more  IPCO 2007»
13 years 8 months ago
The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization
Abstract. A well established heuristic approach for solving various bicriteria optimization problems is to enumerate the set of Pareto optimal solutions, typically using some kind ...
René Beier, Heiko Röglin, Berthold V&o...
JMLR
2007
104views more  JMLR 2007»
13 years 7 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
SIGCOMM
2006
ACM
14 years 1 months ago
Algorithms to accelerate multiple regular expressions matching for deep packet inspection
There is a growing demand for network devices capable of examining the content of data packets in order to improve network security and provide application-specific services. Most...
Sailesh Kumar, Sarang Dharmapurikar, Fang Yu, Patr...