134 search results - page 19 / 27 » A Boyer-Moore Type Algorithm for Compressed Pattern Matching |
139
click to vote
DEBS
2007
ACM
15 years 6 months ago
2007
ACM
Content-based publish/subscribe systems allow matching the content of events with predicates in the subscriptions. However, most existing systems only allow a limited set of opera...
128
Voted
CPM
2001
Springer
15 years 6 months ago
2001
Springer
Lempel Ziv Coding (Extended Abstract). . . . . . . . . . . . . . . . . . . . . . . 18 Shmuel Tomi Klein, Yair Wiseman Approximate Matching of Run-Length Compressed Strings . . . . ...
99
Voted
VIP
2001
15 years 3 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...
115
Voted
CVPR
2007
IEEE
16 years 4 months ago
2007
IEEE
We propose a novel MRF-based model for deformable image matching (also known as registration). The deformation is described by a field of discrete variables, representing displace...
136
click to vote
CCP
2011
14 years 2 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...