Sciweavers

3934 search results - page 176 / 787
» Approximate Schedulability Analysis
Sort
View
NN
2010
Springer
163views Neural Networks» more  NN 2010»
15 years 1 months ago
Approximating the stability region of a neural network with a general distribution of delays
We investigate the linear stability of a neural network with distributed delay, where the neurons are identical. We examine the stability of a symmetrical equilibrium point via th...
R. Jessop, S. A. Campbell
CISS
2008
IEEE
16 years 27 days ago
On sparse representations of linear operators and the approximation of matrix products
—Thus far, sparse representations have been exploited largely in the context of robustly estimating functions in a noisy environment from a few measurements. In this context, the...
Mohamed-Ali Belabbas, Patrick J. Wolfe
ADCM
2008
187views more  ADCM 2008»
15 years 6 months ago
Approximation on the sphere using radial basis functions plus polynomials
In this paper we analyse a hybrid approximation of functions on the sphere S2 R3 by radial basis functions combined with polynomials, with the radial basis functions assumed to be...
Ian H. Sloan, Alvise Sommariva
JSC
2007
97views more  JSC 2007»
15 years 6 months ago
On approximate triangular decompositions in dimension zero
Triangular decompositions for systems of polynomial equations with n variables, with exact coefficients, are well developed theoretically and in terms of implemented algorithms i...
Marc Moreno Maza, Gregory J. Reid, Robin Scott, We...
JDA
2008
122views more  JDA 2008»
15 years 6 months ago
An approximation algorithm for sorting by reversals and transpositions
Abstract. Genome rearrangement algorithms are powerful tools to analyze gene orders in molecular evolution. Analysis of genomes evolving by reversals and transpositions leads to a ...
Atif Rahman, Swakkhar Shatabda, Masud Hasan