Sciweavers

1688 search results - page 71 / 338
» The Complexity of Rationalizing Matchings
Sort
View
ICIP
2005
IEEE
14 years 11 months ago
Irregular pattern matching using projections
Recently, a novel approach to pattern matching was introduced, which reduces time complexity by two orders of magnitude over traditional approaches. It uses an efficient projectio...
Michal Ben-Yehuda, Lihi Cadany, Hagit Hel-Or
CVPR
2008
IEEE
14 years 4 months ago
Fast kernel learning for spatial pyramid matching
Spatial pyramid matching (SPM) is a simple yet effective approach to compute similarity between images. Similarity kernels at different regions and scales are usually fused by som...
Junfeng He, Shih-Fu Chang, Lexing Xie
ICPR
2008
IEEE
14 years 4 months ago
A new method to obtain the shift-table in Boyer-Moore's string matching algorithm
The Boyer-Moore algorithm uses two pre-computed tables for searching a string: skip, which utilizes the occurrence heuristic of symbols in a pattern, and shift, which utilizes the...
Yang Wang
IPPS
2007
IEEE
14 years 4 months ago
Using Rewriting Logic to Match Patterns of Instructions from a Compiler Intermediate Form to Coarse-Grained Processing Elements
This paper presents a new and retargetable method to identify patterns of instructions with direct support in coarsegrained processing elements (PEs). The method uses a three-addr...
Carlos Morra, João M. P. Cardoso, Jürg...
DDECS
2006
IEEE
79views Hardware» more  DDECS 2006»
14 years 4 months ago
Multiple-Vector Column-Matching BIST Design Method
- Extension of a BIST design algorithm is proposed in this paper. The method is based on a synthesis of a combinational block - the decoder, transforming pseudo-random code words i...
Petr Fiser, Hana Kubatova