Sciweavers

58 search results - page 3 / 12
» Merging the Results of Approximate Match Operations
Sort
View
IJFCS
2002
58views more  IJFCS 2002»
13 years 5 months ago
Vector Algorithms for Approximate String Matching
Vector algorithms allow the computation of an output vector r = r1r2 :::rm given an input vector e = e1e2 :::em in a bounded number of operations, independent of m the length of t...
Anne Bergeron, Sylvie Hamel
IIS
2003
13 years 6 months ago
Web Search Results Clustering in Polish: Experimental Evaluation of Carrot
Abstract. In this paper we consider the problem of web search results clustering in the Polish language, supporting our analysis with results acquired from an experimental system n...
Dawid Weiss, Jerzy Stefanowski
ECAI
2008
Springer
13 years 7 months ago
Approximate structure preserving semantic matching
Abstract. Typical ontology matching applications, such as ontology integration, focus on the computation of correspondences holding between the nodes of two graph-like structures, ...
Fausto Giunchiglia, Mikalai Yatskevich, Fiona McNe...
FCCM
2006
IEEE
137views VLSI» more  FCCM 2006»
13 years 11 months ago
Single Pass, BLAST-Like, Approximate String Matching on FPGAs
Abstract: Approximate string matching is fundamental to bioinformatics, and has been the subject of numerous FPGA acceleration studies. We address issues with respect to FPGA imple...
Martin C. Herbordt, Josh Model, Yongfeng Gu, Bhara...
CIDR
2007
138views Algorithms» more  CIDR 2007»
13 years 7 months ago
MOMA - A Mapping-based Object Matching System
Object matching or object consolidation is a crucial task for data integration and data cleaning. It addresses the problem of identifying object instances in data sources referrin...
Andreas Thor, Erhard Rahm