Sciweavers

1793 search results - page 160 / 359
» On the Design of Codes for DNA Computing
Sort
View
ESA
2001
Springer
105views Algorithms» more  ESA 2001»
15 years 11 months ago
SNPs Problems, Complexity, and Algorithms
Abstract. Single nucleotide polymorphisms (SNPs) are the most frequent form of human genetic variation. They are of fundamental importance for a variety of applications including m...
Giuseppe Lancia, Vineet Bafna, Sorin Istrail, Ross...
BMCBI
2007
115views more  BMCBI 2007»
15 years 7 months ago
A novel, fast, HMM-with-Duration implementation - for application with a new, pattern recognition informed, nanopore detector
Background: Hidden Markov Models (HMMs) provide an excellent means for structure identification and feature extraction on stochastic sequential data. An HMM-with-Duration (HMMwD) ...
Stephen Winters-Hilt, Carl Baribault
DCC
2001
IEEE
16 years 6 months ago
A Posteriori Quantized Matching Pursuit
This paper studies quantization error in the context of Matching Pursuit coded streams and proposes a new coefficient quantization scheme taking benefit of the Matching Pursuit pr...
Pascal Frossard, Pierre Vandergheynst
AINA
2007
IEEE
16 years 1 months ago
Collaborative Signal Reinforcement in Sensor Networks
Nodes in sensor fields and in autonomous swarms of mobile robots need to communicate; this usually requires individual nodes to either consume a significant amount of energy, ca...
Tingting Meng, Peter M. Athanas
167
Voted
PPOPP
2005
ACM
16 years 16 days ago
Static analysis of atomicity for programs with non-blocking synchronization
In concurrent programming, non-blocking synchronization is very efficient but difficult to design correctly. This paper presents a static analysis to show that code blocks are ato...
Liqiang Wang, Scott D. Stoller