The following pages link to (Q3675490):
Displaying 38 items.
- A signal theory approach to support vector classification: the sinc kernel (Q280313) (← links)
- Fundamental solutions for singularities within a layered solid (Q340200) (← links)
- Constructive universal algebra: An introduction (Q579289) (← links)
- Symmetry-based matrix factorization (Q597055) (← links)
- Computation of approximate optimal policies in a partially observed inventory model with rain checks (Q642900) (← links)
- Evolving generation and fast algorithms of slantlet transform and slantlet-Walsh transform (Q668725) (← links)
- The smoothing properties of variational schemes for surface design (Q673506) (← links)
- Improved upper complexity bounds for the discrete Fourier transform (Q811112) (← links)
- Distribution of a class of divide and conquer recurrences arising from the computation of the Walsh-Hadamard transform (Q818111) (← links)
- Transform decomposition in two-dimensional digital filter realization (Q1062955) (← links)
- The decimation-in-frequency algorithms for a family of discrete sine and cosine transforms (Q1105346) (← links)
- Index transforms for multidimensional DFT's and convolutions (Q1119008) (← links)
- Iterative methods for ill-conditioned Toeplitz matrices (Q1127946) (← links)
- An analytic approach to practical state space reconstruction (Q1195541) (← links)
- Rapid solution of integral equations of scattering theory in two dimensions (Q1262727) (← links)
- Discrepancy-based error estimates for quasi-Monte Carlo. III: Error distributions and central limits (Q1292601) (← links)
- Non-Gaussian distributions (Q1294244) (← links)
- Probabilistic analysis on the splitting-shooting method for image transformations (Q1298797) (← links)
- In-place self-sorting fast Fourier transform algorithm with local memory references (Q1299629) (← links)
- Fast progressive reconstruction of images using the DCT (Q1310900) (← links)
- Symmetry stabilization for fast discrete monomial transforms and polynomial evaluation (Q1311327) (← links)
- Semi-analytic time-marching algorithms for semilinear parabolic equations (Q1343047) (← links)
- Discrete Fourier transform computation using prime Ramanujan numbers (Q1370324) (← links)
- Inverting block Toeplitz matrices in block Hessenberg form by means of displacement operators: Application to queueing problems (Q1379101) (← links)
- Non-Gaussian distributions. (Q1569180) (← links)
- Double coset decompositions and computational harmonic analysis on groups (Q1581065) (← links)
- Algorithms for fast convolutions on motion groups (Q1582144) (← links)
- Interactions and stability of solitary waves in shallow water. (Q1610114) (← links)
- Separation of variables and the computation of Fourier transforms on finite groups. II (Q1704873) (← links)
- Nonlinear \(q\)-ary codes with large code distance (Q1752309) (← links)
- The efficient computation of Fourier transforms on semisimple algebras (Q1783700) (← links)
- A fast algorithm for expansion over spherical harmonics (Q1901473) (← links)
- Fast transforms of Toeplitz matrices (Q1906767) (← links)
- Characteristic vector and weight distribution of a linear code (Q2040349) (← links)
- A new class of quaternary codes (Q2498318) (← links)
- Orthogonal transforms in bases of slant step functions. II: Methods of generating orthogonal slant transforms with fast algorithms for image coding and compression (Q2508799) (← links)
- Exploiting compression in solving discretized linear systems (Q2672181) (← links)
- Advances on Random Sequence Generation by Uniform Cellular Automata (Q2944879) (← links)
