Sciweavers

8824 search results - page 63 / 1765
» On the Complexity of Real Functions
Sort
View
CAGD
2006
90views more  CAGD 2006»
14 years 12 months ago
Local hybrid approximation for scattered data fitting with bivariate splines
We suggest a local hybrid approximation scheme based on polynomials and radial basis functions, and use it to modify the scattered data fitting algorithm of [7]. Similar to that a...
Oleg Davydov, Rossana Morandi, Alessandra Sestini
AMC
2007
90views more  AMC 2007»
14 years 12 months ago
Computing the square roots of matrices with central symmetry
: For computing square roots of a nonsingular matrix A, which are functions of A, two well known fast and stable algorithms, which are based on the Schur decomposition of A, were p...
Zhongyun Liu, Yulin Zhang, Rui Ralha
DAC
1998
ACM
15 years 4 months ago
A Geographically Distributed Framework for Embedded System Design and Validation
The di culty of embedded system co-design is increasing rapidly due to the increasing complexity of individual parts, the variety of parts available and pressure to use multiple p...
Ken Hines, Gaetano Borriello
IJCNN
2006
IEEE
15 years 5 months ago
Pattern Selection for Support Vector Regression based on Sparseness and Variability
— Support Vector Machine has been well received in machine learning community with its theoretical as well as practical value. However, since its training time complexity is cubi...
Jiyoung Sun, Sungzoon Cho
75
Voted
ESANN
2007
15 years 1 months ago
Controlling complexity of RBF networks by similarity
Abstract. Using radial basis function networks for function approximation tasks suffers from unavailable knowledge about an adequate network size. In this work, a measuring techni...
Ulrich Rückert, Ralf Eickhoff