Sciweavers

3038 search results - page 31 / 608
» High-Speed Function Approximation
Sort
View
83
Voted
TASLP
2008
133views more  TASLP 2008»
14 years 9 months ago
Adaptive System Identification in the Short-Time Fourier Transform Domain Using Cross-Multiplicative Transfer Function Approxima
In this paper, we introduce cross-multiplicative transfer function (CMTF) approximation for modeling linear systems in the short-time Fourier transform (STFT) domain. We assume tha...
Yekutiel Avargel, Israel Cohen
89
Voted
JOI
2007
99views more  JOI 2007»
14 years 9 months ago
Measuring quality of similarity functions in approximate data matching
This paper presents a method for assessing the quality of similarity functions. The scenario taken into account is that of approximate data matching, in which it is necessary to d...
Roberto da Silva, Raquel Kolitski Stasiu, Viviane ...
ADCM
2007
155views more  ADCM 2007»
14 years 9 months ago
Numerical differentiation by radial basis functions approximation
Based on radial basis functions approximation, we develop in this paper a new computational algorithm for numerical differentiation. Under an a priori and an a posteriori choice r...
T. Wei, Y. C. Hon
80
Voted
ICFHR
2010
136views Biometrics» more  ICFHR 2010»
14 years 4 months ago
Digital Ink Compression via Functional Approximation
Representing digital ink traces as points in a function space has proven useful for online recognition. Ink trace coordinates or their integral invariants are written as parametri...
Vadim Mazalov, Stephen M. Watt
70
Voted
ALT
1999
Springer
15 years 2 months ago
On the Uniform Learnability of Approximations to Non-Recursive Functions
Abstract. Blum and Blum (1975) showed that a class B of suitable recursive approximations to the halting problem is reliably EX-learnable. These investigations are carried on by sh...
Frank Stephan, Thomas Zeugmann