804 search results - page 21 / 161 » Solutions to Computational Problems Through Gene Assembly |
CVPR
2005
IEEE
14 years 9 months ago
2005
IEEE
We propose a solution to the n-frame correspondence problem under the factorization framework. During the matching process, our algorithm takes explicitly into account the geometr...
SIAMIS
2010
13 years 2 months ago
2010
Abstract. We propose an algorithmic framework for computing global solutions of variational models with convex regularity terms that permit quite arbitrary data terms. While the mi...
ICTAI
2010
IEEE
13 years 5 months ago
2010
IEEE
Abstract--Today's molecular biology is confronted with enormous amounts of data, generated by new high-throughput technologies, along with an increasing number of biological m...
SOFSEM
2004
Springer
14 years 1 months ago
2004
Springer
Our aim is to investigate the factors which determine the intrinsic hardness of constructing a solution to any particular constraint satisfaction problem instance, regardless of th...
NA
2006
13 years 7 months ago
2006
Truncated singular value decomposition is a popular solution method for linear discrete ill-posed problems. However, since the singular value decomposition of the matrix is indepen...