Sciweavers

381 search results - page 11 / 77
» Approximate Matching of Hierarchical Data Using pq-Grams
Sort
View
IPPS
2002
IEEE
13 years 11 months ago
Approximate String Matching in LDAP Based on Edit Distance
As the E-Commerce rapidly grows up, searching data is almost necessary in every application. Approximate string matching problems play a very important role to search with errors....
Chi-Chien Pan, Kai-Hsiang Yang, Tzao-Lin Lee
VLDB
2004
ACM
120views Database» more  VLDB 2004»
14 years 1 days ago
Merging the Results of Approximate Match Operations
Data Cleaning is an important process that has been at the center of research interest in recent years. An important end goal of effective data cleaning is to identify the relatio...
Sudipto Guha, Nick Koudas, Amit Marathe, Divesh Sr...
IDEAL
2004
Springer
14 years 2 days ago
Mining Large Engineering Data Sets on the Grid Using AURA
AURA (Advanced Uncertain Reasoning Architecture) is a parallel pattern matching technology intended for high-speed approximate search and match operations on large unstructured dat...
Bojian Liang, Jim Austin
CAGD
2002
97views more  CAGD 2002»
13 years 6 months ago
Hierarchical multiresolution reconstruction of shell surfaces
We present an adaptive, hierarchical Hh-multiresolution reconstruction algorithm to model shell surface objects from a matched pair of triangulated surfaces. Shell surfaces are an...
Chandrajit L. Bajaj, Guoliang Xu, Robert J. Holt, ...
IQIS
2007
ACM
13 years 8 months ago
Accuracy of Approximate String Joins Using Grams
Approximate join is an important part of many data cleaning and integration methodologies. Various similarity measures have been proposed for accurate and efficient matching of st...
Oktie Hassanzadeh, Mohammad Sadoghi, Renée ...