148 search results - page 12 / 30 » Linear Time Algorithm for the Longest Common Repeat Problem |
18
Voted
FOCS
2002
IEEE
14 years 24 days ago
2002
IEEE
Abstract—This paper generalizes the classical Knuth–Schönhage algorithm computing the greatest common divisor (gcd) of two polynomials for solving arbitrary linear Diophantine...
ASPDAC
1999
ACM
14 years 5 days ago
1999
ACM
In this paper, two faster and better spectral algorithms are presented for the multi-way circuit partitioning problem with the objective of minimizing the Scaled Cost. As pointed ...
ATAL
2007
Springer
14 years 2 months ago
2007
Springer
We consider the problem of finding optimal strategies in infinite extensive form games with incomplete information that are repeatedly played. This problem is still open in lite...
3DPH
2009
13 years 9 months ago
2009
Abstract. A common problem in optical motion capture of human-body movement is the so-called missing marker problem. The occlusion of markers can lead to significant problems in tr...
CPM
2009
Springer
14 years 2 months ago
2009
Springer
A classical measure of similarity between strings is the length of the longest common subsequence(LCS) between the two given strings. The search for efficient algorithms for findi...