714 search results - page 11 / 143 » An efficient algorithm for positive realizations |
AAIM
2007
Springer
14 years 14 days 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...
BMCBI
2008
13 years 8 months ago
2008
Background: Motif finding algorithms have developed in their ability to use computationally efficient methods to detect patterns in biological sequences. However the posterior cla...
BMCBI
2010
13 years 8 months ago
2010
Background: Graph drawing is one of the important techniques for understanding biological regulations in a cell or among cells at the pathway level. Among many available layout al...
PERCOM
2007
ACM
14 years 8 months ago
2007
ACM
: Global positioning systems (GPS) and mobile phone networks are making it possible to track individual users with an increasing accuracy. It is natural to ask whether one can use ...
MVA
2002
13 years 8 months ago
2002
In this paper, we propose an efficient method for tracking multiple objects, which deals with occlusion situations in an image. We use Shape from silhouettes method to reconstruct...