Sciweavers

1192 search results - page 54 / 239
» Computing Weakest Readings
Sort
View
SCFBM
2008
91views more  SCFBM 2008»
14 years 11 months ago
Simple tools for assembling and searching high-density picolitre pyrophosphate sequence data
Background: The advent of pyrophosphate sequencing makes large volumes of sequencing data available at a lower cost than previously possible. However, the short read lengths are d...
Nicolas J. Parker, Andrew G. Parker
BMCBI
2011
14 years 6 months ago
DecGPU: distributed error correction on massively parallel graphics processing units using CUDA and MPI
Background: Next-generation sequencing technologies have led to the high-throughput production of sequence data (reads) at low cost. However, these reads are significantly shorter...
Yongchao Liu, Bertil Schmidt, Douglas L. Maskell
OSDI
2004
ACM
16 years 4 days ago
Enhancing Server Availability and Security Through Failure-Oblivious Computing
We present a new technique, failure-oblivious computing, that enables servers to execute through memory errors without memory corruption. Our safe compiler for C inserts checks th...
Martin C. Rinard, Cristian Cadar, Daniel Dumitran,...
FPL
2010
Springer
188views Hardware» more  FPL 2010»
14 years 9 months ago
SeqHive: A Reconfigurable Computer Cluster for Genome Re-sequencing
We demonstrate how Field Programmable Gate Arrays (FPGAs) may be used to address the computing challenges associated with assembling genome sequences from recent ultra-high-through...
Kristian Stevens, Henry Chen, Terry Filiba, Peter ...
ICDE
2009
IEEE
223views Database» more  ICDE 2009»
16 years 1 months ago
Another Outlier Bites the Dust: Computing Meaningful Aggregates in Sensor Networks
Abstract-- Recent work has demonstrated that readings provided by commodity sensor nodes are often of poor quality. In order to provide a valuable sensory infrastructure for monito...
Antonios Deligiannakis, Yannis Kotidis, Vasilis Va...