2089 search results - page 17 / 418 » A New Problem in String Searching |
BIBE
2007
IEEE
15 years 4 months ago
2007
IEEE
—We investigate the k-LCS problem that is finding a longest common subsequence (LCS) for k given input strings. The problem is known to have practical solutions for k = 2, but f...
ISAAC
2003
Springer
15 years 2 months ago
2003
Springer
Abstract. We present a bit-parallel technique to search a text of length n for a regular expression of m symbols permitting k differences in worst case time O(mn/ logk s), where s...
AUSAI
2003
Springer
15 years 2 months ago
2003
Springer
Abstract. The RGCP (Robust Graph Coloring problem) is a new variant of the traditional graph coloring problem. It has numerous practical applications in real world like timetabling...
65
Voted
CORR
2008
Springer
14 years 9 months ago
2008
Springer
In 2003, Leonid A. Levin presented the idea of a combinatorial complete one-way function and a sketch of the proof that Tiling represents such a function. In this paper, we presen...
DI
2006
14 years 9 months ago
2006
Fuzzy hashing allows the discovery of potentially incriminating documents that may not be located using traditional hashing methods. The use of the fuzzy hash is much like the fuz...