Sciweavers

3256 search results - page 81 / 652
» Learning Linear Transformations
Sort
View
TIT
2008
74views more  TIT 2008»
13 years 7 months ago
Modular Representations of Polynomials: Hyperdense Coding and Fast Matrix Multiplication
A certain modular representation of multilinear polynomials is considered. The modulo 6 representation of polynomial f is just any polynomial f + 6g. The 1-a-strong representation ...
Vince Grolmusz
CIS
2008
Springer
13 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
CASES
2006
ACM
14 years 1 months ago
Memory optimization by counting points in integer transformations of parametric polytopes
Memory size reduction and memory accesses optimization are crucial issues for embedded systems. In the context of affine programs, these two challenges are classically tackled by ...
Rachid Seghir, Vincent Loechner
ICML
2005
IEEE
14 years 8 months ago
Learning Gaussian processes from multiple tasks
We consider the problem of multi-task learning, that is, learning multiple related functions. Our approach is based on a hierarchical Bayesian framework, that exploits the equival...
Kai Yu, Volker Tresp, Anton Schwaighofer
ESANN
2004
13 years 9 months ago
Robust overcomplete matrix recovery for sparse sources using a generalized Hough transform
We propose an algorithm for recovering the matrix A in X = AS where X is a random vector of lower dimension than S. S is assumed to be sparse in the sense that S has less nonzero e...
Fabian J. Theis, Pando G. Georgiev, Andrzej Cichoc...