Sciweavers

417 search results - page 56 / 84
» Running Time Predictions for Factoring Algorithms
Sort
View
CORR
2002
Springer
102views Education» more  CORR 2002»
14 years 11 months ago
Quantum Lower Bound for Recursive Fourier Sampling
One of the earliest quantum algorithms was discovered by Bernstein and Vazirani, for a problem called Recursive Fourier Sampling. This paper shows that the Bernstein-Vazirani algo...
Scott Aaronson
RECOMB
2009
Springer
16 years 13 days ago
Simultaneous Alignment and Folding of Protein Sequences
Abstract. Accurate comparative analysis tools for low-homology proteins remains a difficult challenge in computational biology, especially sequence alignment and consensus folding ...
Bonnie Berger, Charles W. O'Donnell, Jér&oc...
CVPR
1999
IEEE
16 years 1 months ago
Explaining Optical Flow Events with Parameterized Spatio-Temporal Models
A spatio-temporal representation for complex optical flow events is developed that generalizes traditional parameterized motion models (e.g. affine). These generative spatio-tempo...
Michael J. Black
RECOMB
2004
Springer
16 years 4 days ago
Modeling and Analysis of Heterogeneous Regulation in Biological Networks
Abstract. In this study we propose a novel model for the representation of biological networks and provide algorithms for learning model parameters from experimental data. Our appr...
Irit Gat-Viks, Amos Tanay, Ron Shamir
TC
2008
14 years 11 months ago
An Availability-Aware Task Scheduling Strategy for Heterogeneous Systems
High availability is a key requirement in the design and development of heterogeneous systems, where processors operate at different speeds and are not continuously available for ...
Xiao Qin, Tao Xie 0004