Sciweavers

1381 search results - page 270 / 277
» Computational Complexity of Constraint Satisfaction
Sort
View
BMCBI
2002
108views more  BMCBI 2002»
13 years 7 months ago
A memory-efficient dynamic programming algorithm for optimal alignment of a sequence to an RNA secondary structure
Background: Covariance models (CMs) are probabilistic models of RNA secondary structure, analogous to profile hidden Markov models of linear sequence. The dynamic programming algo...
Sean R. Eddy
FOCM
2002
140views more  FOCM 2002»
13 years 7 months ago
Adaptive Wavelet Methods II - Beyond the Elliptic Case
This paper is concerned with the design and analysis of adaptive wavelet methods for systems of operator equations. Its main accomplishment is to extend the range of applicability...
Albert Cohen, Wolfgang Dahmen, Ronald A. DeVore
ICCAD
2009
IEEE
147views Hardware» more  ICCAD 2009»
13 years 5 months ago
SAT-based protein design
Computational protein design can be formulated as an optimization problem, where the objective is to identify the sequence of amino acids that minimizes the energy of a given prot...
Noah Ollikainen, Ellen Sentovich, Carlos Coelho, A...
TSP
2010
13 years 2 months ago
Noninvertible gabor transforms
Abstract--Time-frequency analysis, such as the Gabor transform, plays an important role in many signal processing applications. The redundancy of such representations is often dire...
Ewa Matusiak, Tomer Michaeli, Yonina C. Eldar
CGO
2011
IEEE
12 years 11 months ago
Language and compiler support for auto-tuning variable-accuracy algorithms
—Approximating ideal program outputs is a common technique for solving computationally difficult problems, for adhering to processing or timing constraints, and for performance ...
Jason Ansel, Yee Lok Wong, Cy P. Chan, Marek Olsze...