Results 251 to 260 of about 123,647 (323)

SPOmiAlign: a modality-agnostic computational framework for multimodal spatial omics alignment enabled by a feature matching foundation model. [PDF]

Brief Bioinform
Wang Y, He Z, Yan Y.
europepmc   +1 more source

Model-agnostic linear-memory online learning in spiking neural networks. [PDF]

Nat Commun
Wang C, Dong X, Ji Z, Xiao M, Jiang J, Liu X, Huan Y, Wu S.   +7 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

On the multiplicative complexity of discrete cosine transforms

IEEE Transactions on Information Theory, 1992
Computing the discrete cosine transform (DCT) involves multiplying an arbitrary real vector of length \(N\) by the matrix \(K_ N:=(\cos(2\pi j(2k+1)/(4N)))^{N-1}_{j,k=0}\). The minimum number of nonrational multiplications required to compute the product of an arbitrary real vector of length \(N\) by a real \((N,N)\)-matrix \(M\) is denoted by \(\mu(M)\
S Winograd
exaly   +4 more sources

On computing the discrete Fourier and cosine transforms

IEEE Transactions on Acoustics, Speech, and Signal Processing, 1985
An efficient algorithm based on real matrix decomposition is developed for computing a class of sinusoidal transforms, that include the discrete Fourier and cosine transform.
Zhongde Wang
exaly   +3 more sources

A serial-parallel architecture for two-dimensional discrete cosine and inverse discrete cosine transforms [PDF]

IEEE Transactions on Computers, 2000
The Discrete Cosine and Inverse Discrete Cosine Transforms are widely used tools in many digital signal and image processing applications. The complexity of these algorithms often requires dedicated hardware support to satisfy the performance ...
Hyesook Lim, Vincenzo Piuri, E E Swartzlander   +2 more
exaly   +3 more sources

Convolution Using Discrete Sine and Cosine Transforms [PDF]

IEEE Signal Processing Letters, 2007
In this paper, we derive a relation for the circular convolution operation in the discrete sine and cosine transform domains. The transform coefficients are either symmetric or asymmetric and hence we need to calculate only half of the total coefficients.
Soo Ngee Koh, V G Reju, Yann Soon
exaly   +3 more sources

Discrete Cosine Transform

IEEE Transactions on Computers, 1974
A discrete cosine transform (DCT) is defined and an algorithm to compute it using the fast Fourier transform is developed. It is shown that the discrete cosine transform can be used in the area of digital processing for the purposes of pattern recognition and Wiener filtering.
Nasir Ahmed 0001, T. Raj Natarajan, K. R. Rao 0001   +2 more
exaly   +3 more sources