Sciweavers

664 search results - page 82 / 133
» Some results for a class of generalized polynomials
Sort
View
NIPS
2008
14 years 11 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
CDC
2009
IEEE
149views Control Systems» more  CDC 2009»
15 years 2 months ago
Solving large-scale linear circuit problems via convex optimization
Abstract— A broad class of problems in circuits, electromagnetics, and optics can be expressed as finding some parameters of a linear system with a specific type. This paper is...
Javad Lavaei, Aydin Babakhani, Ali Hajimiri, John ...
EUROCRYPT
2001
Springer
15 years 2 months ago
Analysis of Key-Exchange Protocols and Their Use for Building Secure Channels
Abstract. We present a formalism for the analysis of key-exchange protocols that combines previous definitional approaches and results in a definition of security that enjoys som...
Ran Canetti, Hugo Krawczyk
ESANN
2004
14 years 11 months ago
Forbidden Magnification? I
This paper presents some interesting results obtained by the algorithm by Bauer, Der and Hermann (BDH) [1] for magnification control in Self-Organizing Maps. Magnification control ...
Abha Jain, Erzsébet Merényi
MP
2002
86views more  MP 2002»
14 years 9 months ago
Multistars, partial multistars and the capacitated vehicle routing problem
In an unpublished paper, Araque, Hall and Magnanti considered polyhedra associated with the Capacitated Vehicle Routing Problem (CVRP) in the special case of unit demands. Among th...
Adam N. Letchford, Richard W. Eglese, Jens Lysgaar...