Sciweavers

539 search results - page 46 / 108
» Linear complexity of transformed sequences
Sort
View
MPC
1995
Springer
150views Mathematics» more  MPC 1995»
15 years 1 months ago
Architecture Independent Massive Parallelization of Divide-and-Conquer Algorithms
Abstract. We present a strategy to develop, in a functional setting, correct, e cient and portable Divide-and-Conquer (DC) programs for massively parallel architectures. Starting f...
Klaus Achatz, Wolfram Schulte
ECOOP
2009
Springer
15 years 4 months ago
Program Metamorphosis
Modern development environments support refactoring by providing atomically behaviour-preserving transformations. While useful, these transformations are limited in three ways: (i)...
Christoph Reichenbach, Devin Coughlin, Amer Diwan
SBCCI
2009
ACM
187views VLSI» more  SBCCI 2009»
15 years 2 months ago
Design of low complexity digital FIR filters
The multiplication of a variable by multiple constants, i.e., the multiple constant multiplications (MCM), has been a central operation and performance bottleneck in many applicat...
Levent Aksoy, Diego Jaccottet, Eduardo Costa
ICIP
2008
IEEE
15 years 11 months ago
Kalman filtered Compressed Sensing
We consider the problem of reconstructing time sequences of spatially sparse signals (with unknown and time-varying sparsity patterns) from a limited number of linear "incohe...
Namrata Vaswani
BMCBI
2010
96views more  BMCBI 2010»
14 years 9 months ago
ModuleOrganizer: detecting modules in families of transposable elements
Background: Most known eukaryotic genomes contain mobile copied elements called transposable elements. In some species, these elements account for the majority of the genome seque...
Sébastien Tempel, Christine Rousseau, Fariz...