Sciweavers

3113 search results - page 213 / 623
» Numerical Methods
Sort
View
SSPR
2000
Springer
15 years 10 months ago
Some Notes on Twenty One (21) Nearest Prototype Classifiers
Comparisons made in two studies of 21 methods for finding prototypes upon which to base the nearest prototype classifier are discussed. The criteria used to compare the methods are...
James C. Bezdek, Ludmila Kuncheva
CORR
2008
Springer
108views Education» more  CORR 2008»
15 years 6 months ago
Hierarchical Bag of Paths for Kernel Based Shape Classification
Graph kernels methods are based on an implicit embedding of graphs within a vector space of large dimension. This implicit embedding allows to apply to graphs methods which where u...
François-Xavier Dupé, Luc Brun
MOC
2000
96views more  MOC 2000»
15 years 6 months ago
Galerkin eigenvector approximations
How close are Galerkin eigenvectors to the best approximation available out of the trial subspace? Under a variety of conditions the Galerkin method gives an approximate eigenvecto...
Christopher Beattie
SIAMSC
2008
145views more  SIAMSC 2008»
15 years 6 months ago
Fast Multilevel Algorithm for a Minimization Problem in Impulse Noise Removal
An effective 2-phase method for removing impulse noise was recently proposed. Its phase 1 identifies noisy pixel candidates by using median-type filters. Then in phase 2, it resto...
Raymond H. Chan, Ke Chen 0002
SIAMSC
2008
97views more  SIAMSC 2008»
15 years 6 months ago
Improvement of Space-Invariant Image Deblurring by Preconditioned Landweber Iterations
The Landweber method is a simple and flexible iterative regularization algorithm, whose projected variant provides nonnegative image reconstructions. Since the method is usually v...
Paola Brianzi, Fabio Di Benedetto, Claudio Estatic...