Sciweavers

5387 search results - page 565 / 1078
» Generating generic functions
Sort
View
ISSS
1995
IEEE
161views Hardware» more  ISSS 1995»
15 years 10 months ago
Synthesis of pipelined DSP accelerators with dynamic scheduling
To construct complete systems on silicon, application speci c DSP accelerators are needed to speed up the execution of high throughput DSP algorithms. In this paper, a methodology...
Patrick Schaumont, Bart Vanthournout, Ivo Bolsens,...
ICA
2010
Springer
15 years 8 months ago
Binary Sparse Coding
We study a sparse coding learning algorithm that allows for a simultaneous learning of the data sparseness and the basis functions. The algorithm is derived based on a generative m...
Marc Henniges, Gervasio Puertas, Jörg Bornsch...
SIAMAM
2000
90views more  SIAMAM 2000»
15 years 6 months ago
Local Strong Homogeneity of a Regularized Estimator
This paper deals with regularized pointwise estimation of discrete signals which contain large strongly homogeneous zones, where typically they are constant, or linear, or more gen...
Mila Nikolova
BMCBI
2010
123views more  BMCBI 2010»
15 years 2 months ago
Predicting conserved protein motifs with Sub-HMMs
Background: Profile HMMs (hidden Markov models) provide effective methods for modeling the conserved regions of protein families. A limitation of the resulting domain models is th...
Kevin Horan, Christian R. Shelton, Thomas Girke
TIT
2011
149views more  TIT 2011»
15 years 2 months ago
Network Coding for Computing: Cut-Set Bounds
Abstract—The following network computing problem is considered. Source nodes in a directed acyclic network generate independent messages and a single receiver node computes a tar...
Rathinakumar Appuswamy, Massimo Franceschetti, Nik...