242 search results - page 2 / 49 » A SAT-Based Algorithm for Context Matching |
CPM
1993
Springer
13 years 9 months ago
1993
Springer
Consider a text string of length n, a pattern string of length m, and a match vector of length n which declares each location in the text to be either a mismatch (the pattern does ...
LICS
2008
IEEE
13 years 11 months ago
2008
IEEE
This paper is an investigation of the matching problem for term equations s = t where s contains context variables, and both terms s and t are given using some kind of compressed ...
CCP
2011
12 years 5 months ago
2011
—The Burrows-Wheeler Transform (BWT) is the basis for many of the most effective compression and selfindexing methods used today. A key to the versatility of the BWT is the abili...
DCC
2005
IEEE
14 years 4 months ago
2005
IEEE
Inspired by the combinatorial denoising method DUDE [13], we present efficient algorithms for implementing this idea for arbitrary contexts or for using it within subsequences. We...
MRCO
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. The paper presents a contexts recognition algorithm that uses the Internet as a knowledge base to extract the multiple contexts of a given situation, based on the streami...