12265 search results - page 264 / 2453 » Knuth-Morris-Pratt Algorithm: An Analysis |
175
click to vote
AAIM
2007
Springer
15 years 10 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...
179
click to vote
VMV
2001
15 years 8 months ago
2001
In this paper, we present a theoretical analysis of the error with three basic Monte Carlo radiosity algorithms, based on continuous collision shooting random walks, discrete coll...
159
click to vote
IJFCS
2008
15 years 6 months ago
2008
We present GLinClosure, a graded extension of the well-known LinClosure algorithm. GLinClosure can be used to compute degrees of semantic entailment from sets of fuzzy attribute i...
170
click to vote
TCOS
2008
15 years 6 months ago
2008
This paper critically analyzes reduct construction methods evels. At a high level, one can abstract commonalities from the existing algorithms, and classify them into three basic g...
157
click to vote
ICASSP
2009
IEEE
15 years 4 months ago
2009
IEEE
Motion estimation methods based on differential techniques proved to be very useful in the context of video analysis, but have a limited employment in classical video compression ...