Sciweavers

1793 search results - page 134 / 359
» On the Design of Codes for DNA Computing
Sort
View
JSA
2008
108views more  JSA 2008»
15 years 6 months ago
A methodology to design arbitrary failure detectors for distributed protocols
Nowadays, there are many protocols able to cope with process crashes, but, unfortunately, a process crash represents only a particular faulty behavior. Handling tougher failures (...
Roberto Baldoni, Jean-Michel Hélary, Sara T...
MOBICOM
2004
ACM
16 years 9 days ago
Using code collection to support large applications on mobile devices
The progress of mobile device technology unfolds a new spectrum of applications that challenges conventional infrastructure models. Most of these devices are perceived by their us...
Lucian Popa 0002, Irina Athanasiu, Costin Raiciu, ...
CIBCB
2007
IEEE
16 years 1 months ago
Multiple Sequence Alignment using Fuzzy Logic
—DNA matching is a crucial step in sequence alignment. Since sequence alignment is an approximate matching process there is a need for good approximate algorithms. The process of...
Sara Nasser, Gregory Vert, Monica N. Nicolescu, Al...
CCS
2008
ACM
15 years 9 months ago
Code injection attacks on harvard-architecture devices
Harvard architecture CPU design is common in the embedded world. Examples of Harvard-based architecture devices are the Mica family of wireless sensors. Mica motes have limited me...
Aurélien Francillon, Claude Castelluccia
LCTRTS
2010
Springer
15 years 8 months ago
An efficient code update scheme for DSP applications in mobile embedded systems
DSP processors usually provide dedicated address generation units (AGUs) to assist address computation. By carefully allocating variables in the memory, DSP compilers take advanta...
Weijia Li, Youtao Zhang