910 search results - page 68 / 182 » Detecting False Matches in String Matching Algorithms |
153
click to vote
NIPS
2008
15 years 4 months ago
2008
How does one extract unknown but stereotypical events that are linearly superimposed within a signal with variable latencies and variable amplitudes? One could think of using temp...
137
click to vote
IPPS
2003
IEEE
15 years 8 months ago
2003
IEEE
Today, in many practical E-Commerce systems, the real stored data usually are short strings, such as names, addresses, or other information. Searching data within these short stri...
117
click to vote
ICDAR
2009
IEEE
15 years 10 months ago
2009
IEEE
Graphics detection and recognition are fundamental research problems in document image analysis and retrieval. As one of the most pervasive graphical elements in business and gove...
109
click to vote
ICAC
2005
IEEE
15 years 8 months ago
2005
IEEE
We present an architecture for and prototype of a system for quickly detecting software problem recurrences. Re-discovery of the same problem is very common in many large software...
136
click to vote
CPM
2001
Springer
15 years 7 months ago
2001
Springer
Lempel Ziv Coding (Extended Abstract). . . . . . . . . . . . . . . . . . . . . . . 18 Shmuel Tomi Klein, Yair Wiseman Approximate Matching of Run-Length Compressed Strings . . . . ...