Sciweavers

1686 search results - page 63 / 338
» Programs as polygraphs: computability and complexity
Sort
View
BMCBI
2010
146views more  BMCBI 2010»
14 years 9 months ago
Genomic selection and complex trait prediction using a fast EM algorithm applied to genome-wide markers
Background: The information provided by dense genome-wide markers using high throughput technology is of considerable potential in human disease studies and livestock breeding pro...
Ross K. Shepherd, Theo H. E. Meuwissen, John A. Wo...
84
Voted
STOC
2006
ACM
149views Algorithms» more  STOC 2006»
15 years 10 months ago
Bounded-error quantum state identification and exponential separations in communication complexity
We consider the problem of bounded-error quantum state identification: given either state 0 or state 1, we are required to output `0', `1' or `?' ("don't ...
Dmitry Gavinsky, Julia Kempe, Oded Regev, Ronald d...
HPCA
2004
IEEE
15 years 10 months ago
Accurate and Complexity-Effective Spatial Pattern Prediction
Recent research suggests that there are large variations in a cache's spatial usage, both within and across programs. Unfortunately, conventional caches typically employ fixe...
Chi F. Chen, Se-Hyun Yang, Babak Falsafi, Andreas ...
AGP
1996
IEEE
15 years 1 months ago
Modular Analysis of Suspension Free cc Programs
Compositional semantics allow to reason about programs in an incremental way, thus providing the formal base for the development of modular data-flow analyses. The major drawback ...
Enea Zaffanella
82
Voted
GECCO
2009
Springer
190views Optimization» more  GECCO 2009»
15 years 1 months ago
Genetic programming for protein related text classification
Since the genomics revolution, bioinformatics has never been so popular. Many researchers have investigated with great success the use of evolutionary computation in bioinformatic...
Marc Segond, Cyril Fonlupt, Denis Robilliard