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

Decomposition and Reconstruction Algorithms for Spline Wavelets on a Bounded Interval

โœ Scribed by Ewald Quak; Norman Weyrich

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
779 KB
Volume
1
Category
Article
ISSN
1063-5203

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Lower bounds and algorithms for flowtime
Lower bounds and algorithms for flowtime minimization on a single machine with set-up times
โœ Simon Dunstall; Andrew Wirth; Kenneth Baker ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Springer US ๐ŸŒ English โš– 165 KB ๐Ÿ‘ 3 views

We consider the scheduling of N jobs divided into G families for processing on a single machine. No set-up is necessary between jobs belonging to the same family. A set-up must be scheduled when switching from the processing of family i jobs to those of another family j, i = j, the duration of this

A fast algorithm for a k-NN classifier b
A fast algorithm for a k-NN classifier based on the branch and bound method and computational quantity estimation
โœ Shin'ichiro Omachi; Hirotomo Aso ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 173 KB ๐Ÿ‘ 3 views

The nearest neighbor rule or k-nearest neighbor rule is a technique of nonparametric pattern recognition. Its algorithm is simple and the error is smaller than twice the Bayes error if there are enough training samples. However, it requires an enormous amount of computation, proportional to the numb