10414 search results - page 13 / 2083 » An efficient algorithm for Co-segmentation |
129
click to vote
AAIM
2007
Springer
15 years 6 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...
126
click to vote
BMCBI
2008
15 years 2 months ago
2008
Background: Aligning RNA sequences with low sequence identity has been a challenging problem since such a computation essentially needs an algorithm with high complexities for tak...
163
click to vote
ENTCS
2002
15 years 2 months ago
2002
We design an efficient algorithm that maximizes the sum of array elements of a subarray of a two-dimensional array. The solution can be used to find the most promising array porti...
114
click to vote
CSC
2008
15 years 3 months ago
2008
- The set-covering problem is an interesting problem in computational complexity theory. In [1], the setcovering problem has been proved to be NP hard and a greedy heuristic algori...
106
Voted
CGI
2004
IEEE
15 years 6 months ago
2004
IEEE
We give an efficient, scalable, and simple algorithm for computation of a central path for navigation in closed virtual environments. The algorithm requires less preprocessing and...