Sciweavers

199 search results - page 11 / 40
» Sequences of low arithmetical complexity
Sort
View
DAGSTUHL
2006
13 years 11 months ago
The optimal sequence compression
This paper presents the optimal compression for sequences with undefined values. Let we have (N -m) undefined and m defined positions in the boolean sequence V of length N. The se...
Alexander E. Andreev
PPOPP
2005
ACM
14 years 3 months ago
Fault tolerant high performance computing by a coding approach
As the number of processors in today’s high performance computers continues to grow, the mean-time-to-failure of these computers are becoming significantly shorter than the exe...
Zizhong Chen, Graham E. Fagg, Edgar Gabriel, Julie...
CSB
2005
IEEE
125views Bioinformatics» more  CSB 2005»
14 years 3 months ago
Peptide Charge State Determination for Low-Resolution Tandem Mass Spectra
Mass spectrometry is a particularly useful technology for the rapid and robust identification of peptides and proteins in complex mixtures. Peptide sequences can be identified b...
Aaron A. Klammer, Christine C. Wu, Michael J. MacC...
MICRO
1996
IEEE
129views Hardware» more  MICRO 1996»
14 years 2 months ago
Trace Cache: A Low Latency Approach to High Bandwidth Instruction Fetching
As the issue widthof superscalar processors is increased, instructionfetch bandwidthrequirements will also increase. It will become necessary to fetch multiple basic blocks per cy...
Eric Rotenberg, Steve Bennett, James E. Smith
ICIP
2003
IEEE
14 years 11 months ago
Optimal framework for low bit-rate block coders
Block coders are among the most common compression tools available for still images and video sequences. Their low computational complexity along with their good performance make ...
Yaakov Tsaig, Michael Elad, Gene H. Golub, Peyman ...