๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The complexity of model classes, and smoothing noisy data

โœ Scribed by Peter L Bartlett; Sanjeev R Kulkarni

Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
118 KB
Volume
34
Category
Article
ISSN
0167-6911

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The Complexity of Indefinite Elliptic Pr
The Complexity of Indefinite Elliptic Problems with Noisy Data
โœ Arthur G. Werschulz ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 194 KB

We study the complexity of second-order indefinite elliptic problems -div(aโˆ‡u) + bu = f (with homogeneous Dirichlet boundary conditions) over a d-dimensional domain , the error being measured in the H 1 ( )-norm. The problem elements f belong to the unit ball of W r, p ( ), where p โˆˆ [2, โˆž] and r >

The enumerability and invariance of comp
The enumerability and invariance of complexity classes
โœ F.D. Lewis ๐Ÿ“‚ Article ๐Ÿ“… 1971 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 772 KB

Several properties of complexity classes and sets associated with them are studied. An open problem, the enumerability of complexity classes, is settled by exhibition of a measure with some nonenumerable classes. Classes for natural measures are found to occupy the same isomorphism type; and a crite

Genetic programming model for forecast o
Genetic programming model for forecast of short and noisy data
โœ C. Sivapragasam; P. Vincent; G. Vasudevan ๐Ÿ“‚ Article ๐Ÿ“… 2007 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 151 KB

## Abstract Though forecasting of river flow has received a great deal of attention from engineers and researchers throughout the world, this still continues to be a challenging task owing to the complexity of the process. In the last decade or so, artificial neural networks (ANNs) have been widely