Sciweavers

1192 search results - page 58 / 239
» Computing Weakest Readings
Sort
View
SAC
2010
ACM
15 years 1 days ago
FANGS: high speed sequence mapping for next generation sequencers
Next Generation Sequencing machines are generating millions of short DNA sequences (reads) everyday. There is a need for efficient algorithms to map these sequences to the referen...
Sanchit Misra, Ramanathan Narayanan, Simon Lin, Al...
IAJIT
2006
109views more  IAJIT 2006»
14 years 12 months ago
Unconstraint Assignment Problem: A Molecular Computing Approach
: Deoxyribonucleic Acid or DNA-based computing is an emerging field that bridging the gap between chemistry, molecular biology, computer science, and mathematics. This research are...
Zuwairie Ibrahim, Yusei Tsuboi, Osamu Ono, Marzuki...
CRYPTO
2003
Springer
187views Cryptology» more  CRYPTO 2003»
15 years 5 months ago
On Constructing Locally Computable Extractors and Cryptosystems in the Bounded Storage Model
We consider the problem of constructing randomness extractors that are locally computable; that is, read only a small number of bits from their input. As recently shown by Lu (thi...
Salil P. Vadhan
VIROLOGY
2008
84views more  VIROLOGY 2008»
14 years 11 months ago
Formal affordance-based models of computer virus reproduction
We present a novel classification of computer viruses using a formalised notion of reproductive models based on Gibson's theory of affordances. A computer virus reproduction ...
Matt Webster, Grant Malcolm
IPSN
2005
Springer
15 years 5 months ago
Some sensor network elements for ubiquitous computing
— Ubiquitous computing applications often use a user's context to automatically adjust their behavior to the situation. We have developed three types of wireless sensor node...
Waylon Brunette, Jonathan Lester, Adam D. Rea, Gae...