110 search results - page 17 / 22 » On Performance of Compressed Pattern Matching on VF Codes |
VLSID
2004
IEEE
14 years 10 months ago
2004
IEEE
demanding algorithm of a video encoder. It is known that about 60% ~ 80% of the total computation time is consumed for motion estimation [1]. The second is its high impact on the v...
FOCS
2009
IEEE
14 years 2 months ago
2009
IEEE
Given a set D = {d1, d2, ..., dD} of D strings of total length n, our task is to report the "most relevant" strings for a given query pattern P. This involves somewhat mo...
ANCS
2007
ACM
14 years 2 months ago
2007
ACM
Modern network intrusion detection systems need to perform regular expression matching at line rate in order to detect the occurrence of critical patterns in packet payloads. Whil...
CPM
1998
Springer
14 years 2 months ago
1998
Springer
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
VIP
2001
13 years 11 months ago
2001
It is often necessary to reduce storage and bandwidth requirements when recording or broadcasting a sequence of actions on a computer screen. These applications most commonly fall...