Sciweavers

125 search results - page 21 / 25
» Cross-Domain Approximate String Matching
Sort
View
AIRS
2004
Springer
14 years 13 days ago
On Bit-Parallel Processing of Multi-byte Text
There exist practical bit-parallel algorithms for several types of pair-wise string processing, such as longest common subsequence computation or approximate string matching. The b...
Heikki Hyyrö, Jun Takaba, Ayumi Shinohara, Ma...
ICAIL
2003
ACM
14 years 9 days ago
A Comparative Evaluation of Name-Matching Algorithms
Name matching—recognizing when two different strings are likely to denote the same entity—is an important task in many legal information systems, such as case-management syste...
Karl Branting
ADC
2008
Springer
141views Database» more  ADC 2008»
14 years 1 months ago
Approximate Retrieval of XML Data with ApproXPath
Several XML query languages have been proposed that use XPath expressions to locate data. But XPath expressions might miss some data because of irregularities in the data and sche...
Lin Xu, Curtis E. Dyreson
WWW
2009
ACM
14 years 7 months ago
Exploiting web search to generate synonyms for entities
Tasks recognizing named entities such as products, people names, or locations from documents have recently received significant attention in the literature. Many solutions to thes...
Surajit Chaudhuri, Venkatesh Ganti, Dong Xin
ICASSP
2011
IEEE
12 years 10 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...