Sciweavers

239 search results - page 35 / 48
» Fast Prefix Code Processing
Sort
View
ICFP
1997
ACM
13 years 11 months ago
Implementing Bit-addressing with Specialization
General media-processing programs are easily expressed with bitaddressing and variable-sized bit-fields. But the natural implementation of bit-addressing relies on dynamic shift ...
Scott Draves
FAST
2010
13 years 10 months ago
A Clean-Slate Look at Disk Scrubbing
A number of techniques have been proposed to reduce the risk of data loss in hard-drives, from redundant disks (e.g., RAID systems) to error coding within individual drives. Disk ...
Alina Oprea, Ari Juels
FAST
2004
13 years 9 months ago
Diamond: A Storage Architecture for Early Discard in Interactive Search
This paper explores the concept of early discard for interactive search of unindexed data. Processing data inside storage devices using downloaded searchlet code enables Diamond t...
Larry Huston, Rahul Sukthankar, Rajiv Wickremesing...
BMCBI
2008
111views more  BMCBI 2008»
13 years 7 months ago
Probabilistic base calling of Solexa sequencing data
Background: Solexa/Illumina short-read ultra-high throughput DNA sequencing technology produces millions of short tags (up to 36 bases) by parallel sequencing-by-synthesis of DNA ...
Jacques Rougemont, Arnaud Amzallag, Christian Isel...
PARELEC
2002
IEEE
14 years 14 days ago
Boosting the Performance of Electromagnetic Simulations on a PC-Cluster
One of the crucial aspects in the design process of high voltage apparatus is the precise simulation of the electrostatic and/or electromagnetic £eld distribution in three dimens...
Carsten Trinitis, Martin Schulz, Wolfgang Karl