4 search results - page 1 / 1 » Approximate Regular Expression Searching with Arbitrary Inte... |
ISAAC
2003
Springer
13 years 10 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...
TROB
2010
13 years 3 months ago
2010
—Robotic systems need to be able to plan control actions that are robust to the inherent uncertainty in the real world. This uncertainty arises due to uncertain state estimation,...
ICCV
2011
IEEE
12 years 4 months ago
2011
IEEE
We propose Compact And Real-time Descriptors (CARD) which can be computed very rapidly and be expressed by short binary codes. An efficient algorithm based on lookup tables is pr...
SIGIR
1998
ACM
13 years 9 months ago
1998
ACM
Abstract We present a fast compression and decompression scheme for natural language texts that allows e cient and exible string matching by searching the compressed text directly....