81 search results - page 16 / 17 » Repetition-free longest common subsequence |
IPPS
1998
IEEE
13 years 10 months ago
1998
IEEE
In this abstract, we provide an overview of our survey of randomized techniques for exploiting the parallelism in string matching problems. Broadly, the study of string matching fa...
CIKM
2008
Springer
13 years 8 months ago
2008
Springer
To find near-duplicate documents, fingerprint-based paradigms such as Broder's shingling and Charikar's simhash algorithms have been recognized as effective approaches a...
ENGL
2006
13 years 6 months ago
2006
Recently, there has been a growth in the amount of machine readable information pertaining to the biomedical field. With this growth comes a desire to be able to extract informati...
ICCAD
2009
IEEE
13 years 4 months ago
2009
IEEE
The flip-chip package is introduced for modern IC designs with higher integration density and larger I/O counts. In this paper, we consider the pre-assignment flip-chip routing pr...
ICASSP
2011
IEEE
12 years 10 months ago
2011
IEEE
We present a robust method to map detected facial Action Units (AUs) to six basic emotions. Automatic AU recognition is prone to errors due to illumination, tracking failures and ...