Sciweavers

780 search results - page 61 / 156
» Robustness and Randomness
Sort
View
SIAMSC
2010
134views more  SIAMSC 2010»
13 years 7 months ago
Moving Least Squares via Orthogonal Polynomials
A method for moving least squares interpolation and differentiation is presented in the framework of orthogonal polynomials on discrete points. This yields a robust and efficient ...
Michael Carley
INCDM
2010
Springer
138views Data Mining» more  INCDM 2010»
13 years 7 months ago
Learning Discriminative Distance Functions for Case Retrieval and Decision Support
The importance of learning distance functions is gradually being acknowledged by the machine learning community, and different techniques are suggested that can successfully learn ...
Alexey Tsymbal, Martin Huber, Shaohua Kevin Zhou
ICMCS
2005
IEEE
71views Multimedia» more  ICMCS 2005»
14 years 2 months ago
A proposal of butterfly-graph based stream authentication over lossy networks
In this paper, we propose a butterfly-graph based stream authentication scheme for lossy networks where the streaming packets could be lost in both random and burst ways. Due to t...
Zhishou Zhang, Qibin Sun, Wai-Choong Wong
ESANN
2008
13 years 10 months ago
Classification of chestnuts with feature selection by noise resilient classifiers
In this paper we solve the problem of classifying chestnut plants according to their place of origin. We compare the results obtained by state of the art classifiers, among which,...
Elena Roglia, Rossella Cancelliere, Rosa Meo
ICONIP
1998
13 years 10 months ago
Statistical Methods for Construction of Neural Networks
Despite all the progress in neural networks the technology is still brittle and sometimes difficult to apply. Automatic construction of networks and proper initialization of their...
Wlodzislaw Duch, Rafal Adamczak