354 search results - page 40 / 71 » Approximate String Joins |
ICML
2005
IEEE
14 years 8 months ago
2005
IEEE
Mappings to structured output spaces (strings, trees, partitions, etc.) are typically learned using extensions of classification algorithms to simple graphical structures (eg., li...
SSDBM
2008
IEEE
14 years 2 months ago
2008
IEEE
Random sampling is a popular technique for providing fast approximate query answers, especially in data warehouse environments. Compared to other types of synopses, random sampling...
IQIS
2005
ACM
14 years 1 months ago
2005
ACM
In this paper, we consider two important problems that commonly occur in bibliographic digital libraries, which seriously degrade their data qualities: Mixed Citation (MC) problem...
CSB
2005
IEEE
14 years 1 months ago
2005
IEEE
This work presents the development of algorithms for approximate string matching using parallel methods. It intends to do the maximum of molecular sequences comparisons per unity ...
ICDE
2010
IEEE
14 years 7 months ago
2010
IEEE
Recognizing the alternative ways people use to reference an entity, is important for many Web applications that query structured data. In such applications, there is often a mismat...