6358 search results - page 301 / 1272 » Computing spectral sequences |
153
click to vote
DAGM
1997
Springer
15 years 11 months ago
1997
Springer
Using the 3-dimensional structure tensor, dense displacement vector fields (DVF) can be computed with subpixel accuracy. The approach is based on the detection of linear symmetrie...
175
click to vote
AAIM
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. The Longest Common Subsequence (LCS) problem is a classic and well-studied problem in computer science. The LCS problem is a common task in DNA sequence analysis with man...
157
click to vote
IPL
2007
15 years 6 months ago
2007
We present a characterization of first-order functional programs which are quasiterminating w.r.t. the symbolic execution mechanism of needed narrowing, i.e., computations in the...
184
click to vote
IPPS
2010
IEEE
15 years 4 months ago
2010
IEEE
The Smith-Waterman (SW) algorithm is one of the widely used algorithms for sequence alignment in computational biology. With the growing size of the sequence database, there is alw...
185
click to vote
BMCBI
2006
15 years 6 months ago
2006
Background: Small interfering RNAs (siRNAs) have become an important tool in cell and molecular biology. Reliable design of siRNA molecules is essential for the needs of large fun...