Sciweavers

2095 search results - page 114 / 419
» Improved pebbling bounds
Sort
View
91
Voted
GLVLSI
1996
IEEE
126views VLSI» more  GLVLSI 1996»
15 years 5 months ago
An Accurate Interconnection Length Estimation for Computer Logic
Important layout properties of electronic designs include space requirements and interconnection lengths. A reliable interconnection length estimation is essential for improving p...
Dirk Stroobandt, Herwig Van Marck, Jan Van Campenh...
103
Voted
ESANN
2001
15 years 2 months ago
Penalized least squares, model selection, convex hull classes and neural nets
We develop improved risk bounds for function estimation with models such as single hidden layer neural nets, using a penalized least squares criterion to select the size of the mod...
Gerald H. L. Cheang, Andrew R. Barron
109
Voted
NIPS
2000
15 years 2 months ago
From Margin to Sparsity
We present an improvement of Noviko 's perceptron convergence theorem. Reinterpreting this mistakebound as a margindependent sparsity guarantee allows us to give a PAC{style ...
Thore Graepel, Ralf Herbrich, Robert C. Williamson
IJSYSC
1998
93views more  IJSYSC 1998»
15 years 15 days ago
A new adaptive control scheme with arbitrary nonlinear inputs
This paper presents a new analysis and design method for model reference adaptive control(MRAC) with arbitrary bounded input nonlinearities. The adaptive algorithm ensures that th...
Wen Yu, Manuel de la Sen
119
Voted
CORR
2011
Springer
148views Education» more  CORR 2011»
14 years 7 months ago
How well can we estimate a sparse vector?
The estimation of a sparse vector in the linear model is a fundamental problem in signal processing, statistics, and compressive sensing. This paper establishes a lower bound on t...
Emmanuel J. Candès, Mark A. Davenport