Sciweavers

6045 search results - page 310 / 1209
» Computable Linearizations of Well-partial-orderings
Sort
View
CIS
2008
Springer
15 years 9 months ago
Discrete Fourier Transform Computation Using Neural Networks
In this paper, a method is introduced how to process the Discrete Fourier Transform (DFT) by a singlelayer neural network with a linear transfer function. By implementing the sugg...
Rosemarie Velik
JPDC
2006
106views more  JPDC 2006»
15 years 7 months ago
Computing nearest neighbors in real time
The nearest-neighbor method can successfully be applied to correct possible errors induced into bit strings transmitted over noisy communication channels or to classify samples in...
Marius Nagy, Selim G. Akl
NA
2008
92views more  NA 2008»
15 years 7 months ago
Computing bivariate splines in scattered data fitting and the finite-element method
A number of useful bivariate spline methods are global in nature, i.e., all of the coefficients of an approximating spline must be computed at one time. Typically this involves sol...
Larry L. Schumaker
JLP
2006
56views more  JLP 2006»
15 years 7 months ago
Linearization of hybrid processes
We present an algorithm for the linearization of hybrid processes modeled in hybrid process algebra (HyPA) and prove its correctness. HyPA is a formalism that is suitable for the ...
P. C. W. den Brand van, Michel A. Reniers, Pieter ...
DAGM
1997
Springer
15 years 11 months ago
A Tensor Approach for Precise Computation of Dense Displacement Vector Fields
Using the 3-dimensional structure tensor, dense displacement vector fields (DVF) can be computed with subpixel accuracy. The approach is based on the detection of linear symmetrie...
Horst Haußecker, Bernd Jähne