2127 search results - page 153 / 426 » Computing large matchings fast |
171
click to vote
SODA
2010
ACM
16 years 1 months ago
2010
ACM
Regular expression matching is a key task (and often computational bottleneck) in a variety of software tools and applications. For instance, the standard grep and sed utilities, ...
174
click to vote
BMCBI
2008
15 years 4 months ago
2008
Background: This paper describes techniques for accelerating the performance of the string set matching problem with particular emphasis on applications in computational proteomic...
163
click to vote
IPPS
2010
IEEE
15 years 2 months ago
2010
IEEE
Multi-pattern string matching remains a major performance bottleneck in network intrusion detection and anti-virus systems for high-speed deep packet inspection (DPI). Although Aho...
146
click to vote
CVPR
2005
IEEE
16 years 6 months ago
2005
IEEE
We approach recognition in the framework of deformable shape matching, relying on a new algorithm for finding correspondences between feature points. This algorithm sets up corres...
166
click to vote
ICCV
1999
IEEE
16 years 6 months ago
1999
IEEE
A Bayesian framework for deformable pattern classification has been proposed in [1] with promising results for isolated handwritten character recognition. Its performance, however...