Sciweavers

237 search results - page 15 / 48
» Practical and Optimal String Matching
Sort
View
VLDB
2002
ACM
184views Database» more  VLDB 2002»
14 years 7 months ago
Database indexing for large DNA and protein sequence collections
Our aim is to develop new database technologies for the approximate matching of unstructured string data using indexes. We explore the potential of the suffix tree data structure i...
Ela Hunt, Malcolm P. Atkinson, Robert W. Irving
ICASSP
2011
IEEE
12 years 11 months ago
A method to infer emotions from facial Action Units
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 ...
Sudha Velusamy, Hariprasad Kannan, Balasubramanian...
GLOBECOM
2007
IEEE
14 years 1 months ago
Performing Packet Content Inspection by Longest Prefix Matching Technology
—This article presents a novel mechanism to perform packet content inspection by longest prefix matching (LPM) technology. It is done by transforming the automaton-based state ta...
Nen-Fu Huang, Yen-Ming Chu, Yen-Min Wu, Chia-Wen H...
CPM
2000
Springer
143views Combinatorics» more  CPM 2000»
13 years 11 months ago
A Boyer-Moore Type Algorithm for Compressed Pattern Matching
Abstract. We apply the Boyer–Moore technique to compressed pattern matching for text string described in terms of collage system, which is a formal framework that captures variou...
Yusuke Shibata, Tetsuya Matsumoto, Masayuki Takeda...
PAMI
2012
11 years 10 months ago
LDAHash: Improved Matching with Smaller Descriptors
—SIFT-like local feature descriptors are ubiquitously employed in such computer vision applications as content-based retrieval, video analysis, copy detection, object recognition...
Christoph Strecha, Alexander A. Bronstein, Michael...