Sciweavers

338 search results - page 30 / 68
» Using pattern matching for tiling and packing problems
Sort
View
CPM
1999
Springer
127views Combinatorics» more  CPM 1999»
15 years 1 months ago
A New Indexing Method for Approximate String Matching
We present a new indexing method for the approximate string matching problem. The method is based on a su x tree combined with a partitioning of the pattern. We analyze the resulti...
Gonzalo Navarro, Ricardo A. Baeza-Yates
CORR
2008
Springer
128views Education» more  CORR 2008»
14 years 9 months ago
A Fast Generic Sequence Matching Algorithm
A string matching--and more generally, sequence matching--algorithm is presented that has a linear worst-case computing time bound, a low worst-case bound on the number of compari...
David R. Musser, Gor V. Nishanov
PAMI
2011
14 years 4 months ago
Latent Fingerprint Matching
Latent fingerprint identification is of critical importance in forensics. While tremendous progress has been made in the field of automatic fingerprint identification, latent...
Anil K. Jain, Jianjiang Feng
VLDB
2007
ACM
204views Database» more  VLDB 2007»
15 years 3 months ago
Optimization of Frequent Itemset Mining on Multiple-Core Processor
Multi-core processors are proliferated across different domains in recent years. In this paper, we study the performance of frequent pattern mining on a modern multi-core machine....
Eric Li, Li Liu
PDP
2009
IEEE
15 years 4 months ago
Task-Parallel versus Data-Parallel Library-Based Programming in Multicore Systems
—Multicore machines are becoming common. There are many languages, language extensions and libraries devoted to improve the programmability and performance of these machines. In ...
Diego Andrade, Basilio B. Fraguela, James C. Brodm...