Sciweavers

3898 search results - page 696 / 780
» On the Bit Extraction Problem
Sort
View
BMCBI
2010
135views more  BMCBI 2010»
14 years 10 months ago
Detecting disease associated modules and prioritizing active genes based on high throughput data
Background: The accumulation of high-throughput data greatly promotes computational investigation of gene function in the context of complex biological systems. However, a biologi...
Yu-Qing Qiu, Shi-Hua Zhang, Xiang-Sun Zhang, Luona...
TIT
2008
164views more  TIT 2008»
14 years 9 months ago
Cryptographic Hardness Based on the Decoding of Reed-Solomon Codes
We investigate the decoding problem of Reed-Solomon (RS) Codes, also known as the Polynomial Reconstruction Problem (PR), from a cryptographic hardness perspective. Namely, we dea...
Aggelos Kiayias, Moti Yung
BMCBI
2004
141views more  BMCBI 2004»
14 years 9 months ago
Estimates of statistical significance for comparison of individual positions in multiple sequence alignments
Background: Profile-based analysis of multiple sequence alignments (MSA) allows for accurate comparison of protein families. Here, we address the problems of detecting statistical...
Ruslan Sadreyev, Nick V. Grishin
MCS
2002
Springer
14 years 9 months ago
Multiclassifier Systems: Back to the Future
Abstract. While a variety of multiple classifier systems have been studied since at least the late 1950's, this area came alive in the 90's with significant theoretical a...
Joydeep Ghosh
CORR
2010
Springer
162views Education» more  CORR 2010»
14 years 8 months ago
Backward Reachability of Array-based Systems by SMT solving: Termination and Invariant Synthesis
The safety of infinite state systems can be checked by a backward reachability procedure. For certain classes of systems, it is possible to prove the termination of the procedure ...
Silvio Ghilardi, Silvio Ranise