169 search results - page 21 / 34 » Matrix Computations Using Quasirandom Sequences |
87
Voted
IEEEMSP
2002
IEEE
15 years 7 months ago
2002
IEEE
—Matrix factorization methods are now widely used to recover 3D structure from 2D projections [1]. In practice, the observation matrix to be factored out has missing data, due to...
BMCBI
2008
15 years 2 months ago
2008
Background: Accurate annotation of translation initiation sites (TISs) is essential for understanding the translation initiation mechanism. However, the reliability of TIS annotat...
170
click to vote
CPM
1998
Springer
15 years 6 months ago
1998
Springer
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
121
click to vote
ICCV
2005
IEEE
16 years 4 months ago
2005
IEEE
We introduce an iterative algorithm for shape reconstruction from multiple images of a moving (Lambertian) object illuminated by distant (and possibly time varying) lighting. Star...
120
Voted
BMCBI
2006
15 years 2 months ago
2006
Background: Detecting remote homologies by direct comparison of protein sequences remains a challenging task. We had previously developed a similarity score between sequences, cal...