Sciweavers

22 search results - page 2 / 5
» Randomized Fast Design of Short DNA Words
Sort
View
JOC
2011
104views more  JOC 2011»
12 years 10 months ago
Short Undeniable Signatures Based on Group Homomorphisms
This paper is devoted to the design and analysis of short undeniable signatures based on a random oracle. Exploiting their online property, we can achieve signatures with a fully s...
Jean Monnerat, Serge Vaudenay
BMCBI
2008
136views more  BMCBI 2008»
13 years 7 months ago
LOMA: A fast method to generate efficient tagged-random primers despite amplification bias of random PCR on pathogens
Background: Pathogen detection using DNA microarrays has the potential to become a fast and comprehensive diagnostics tool. However, since pathogen detection chips currently utili...
Wah-Heng Lee, Christopher W. Wong, Wan Yee Leong, ...
CORR
2008
Springer
128views Education» more  CORR 2008»
13 years 7 months ago
A Fast Generic Sequence Matching Algorithm
A string matching--and more generally, sequence matching--algorithm is presented that has a linear worst-case computing time bound, a low worst-case bound on the number of compari...
David R. Musser, Gor V. Nishanov
ET
2000
145views more  ET 2000»
13 years 7 months ago
Fast Test Pattern Generation for Sequential Circuits Using Decision Diagram Representations
The paper presents a novel hierarchical approach to test pattern generation for sequential circuits based on an input model of mixed-level decision diagrams. A method that handles,...
Jaan Raik, Raimund Ubar
ETS
2011
IEEE
220views Hardware» more  ETS 2011»
12 years 6 months ago
Structural In-Field Diagnosis for Random Logic Circuits
—In-field diagnosability of electronic components in larger systems such as automobiles becomes a necessity for both customers and system integrators. Traditionally, functional ...
Alejandro Cook, Melanie Elm, Hans-Joachim Wunderli...