54 search results - page 9 / 11 » Constrained Longest Common Subsequence Computing Algorithms ... |
CGI
2004
IEEE
13 years 11 months ago
2004
IEEE
Efficient global illumination computation in dynamically changing environments is an important practical problem. In high-quality animation rendering costly "final gathering&...
PR
2011
13 years 2 months ago
2011
This paper introduces a simple Sum-over-Paths (SoP) formulation of string edit distances accounting for all possible alignments between two sequences, and extends related previous...
ICASSP
2011
IEEE
12 years 11 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 ...
CIKM
2008
Springer
13 years 9 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...
CSB
2002
IEEE
14 years 18 days ago
2002
IEEE
There is a pressing need to align growing set of expressed sequence tags (ESTs) to newly sequenced human genome. The problem is, however, complicated by the exon/intron structure ...