Sciweavers

1301 search results - page 9 / 261
» Bounded Version Vectors
Sort
View
APPROX
2008
Springer
127views Algorithms» more  APPROX 2008»
15 years 1 months ago
Approximating Single Machine Scheduling with Scenarios
In the field of robust optimization, the goal is to provide solutions to combinatorial problems that hedge against variations of the numerical parameters. This constitutes an effor...
Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svenss...
75
Voted
SDM
2007
SIAM
81views Data Mining» more  SDM 2007»
15 years 1 months ago
A PAC Bound for Approximate Support Vector Machines
We study a class of algorithms that speed up the training process of support vector machines (SVMs) by returning an approximate SVM. We focus on algorithms that reduce the size of...
Dongwei Cao, Daniel Boley
105
Voted
IACR
2011
129views more  IACR 2011»
13 years 11 months ago
Bounded Vector Signatures and their Applications
Although malleability is undesirable in traditional digital signatures, schemes with limited malleability properties enable interesting functionalities that may be impossible to o...
Lei Wei, Scott E. Coull, Michael K. Reiter
ICCAD
2007
IEEE
173views Hardware» more  ICCAD 2007»
15 years 8 months ago
Bounding L2 gain system error generated by approximations of the nonlinear vector field
Abstract— Typical nonlinear model order reduction approaches need to address two issues: reducing the order of the model, and approximating the vector field. In this paper we fo...
Kin Cheong Sou, Alexandre Megretski, Luca Daniel
TNN
2010
143views Management» more  TNN 2010»
14 years 6 months ago
Using unsupervised analysis to constrain generalization bounds for support vector classifiers
Abstract--A crucial issue in designing learning machines is to select the correct model parameters. When the number of available samples is small, theoretical sample-based generali...
Sergio Decherchi, Sandro Ridella, Rodolfo Zunino, ...