Sciweavers

2031 search results - page 33 / 407
» On Tree-Constrained Matchings and Generalizations
Sort
View
ANCS
2009
ACM
14 years 7 months ago
SPC-FA: synergic parallel compact finite automaton to accelerate multi-string matching with low memory
Deterministic Finite Automaton (DFA) is well-known for its constant matching speed in worst case, and widely used in multistring matching, which is a critical technique in high pe...
Junchen Jiang, Yi Tang, Bin Liu, Xiaofei Wang, Yan...
JEI
2000
134views more  JEI 2000»
14 years 9 months ago
Pattern matching using the blur hit - miss transform
The usefulness of the hit-miss transform (HMT) and related transforms for pattern matching in document image applications is examined. Although the HMT is sensitive to the types o...
Dan S. Bloomberg, Luc Vincent
62
Voted
PR
2007
261views more  PR 2007»
14 years 9 months ago
Image registration by local histogram matching
We previously presented an image registration method, referred to hierarchical attribute matching mechanism for elastic registration (HAMMER), which demonstrated relatively high a...
Dinggang Shen
65
Voted
CIKM
2008
Springer
14 years 11 months ago
Multi-aspect expertise matching for review assignment
Review assignment is a common task that many people such as conference organizers, journal editors, and grant administrators would have to do routinely. As a computational problem...
Maryam Karimzadehgan, ChengXiang Zhai, Geneva G. B...
ANCS
2007
ACM
15 years 1 months ago
Ruler: high-speed packet matching and rewriting on NPUs
Programming specialized network processors (NPU) is inherently difficult. Unlike mainstream processors where architectural features such as out-of-order execution and caches hide ...
Tomas Hruby, Kees van Reeuwijk, Herbert Bos