Sciweavers

1028 search results - page 114 / 206
» Character sets of strings
Sort
View
KDD
2008
ACM
156views Data Mining» more  KDD 2008»
14 years 9 months ago
Unsupervised deduplication using cross-field dependencies
Recent work in deduplication has shown that collective deduplication of different attribute types can improve performance. But although these techniques cluster the attributes col...
Robert Hall, Charles A. Sutton, Andrew McCallum
STOC
2002
ACM
152views Algorithms» more  STOC 2002»
14 years 9 months ago
Universally composable two-party and multi-party secure computation
d Abstract) Ran Canetti Yehuda Lindell Rafail Ostrovsky Amit Sahai? We show how to securely realize any multi-party functionality in a universally composable way, regardless of th...
Ran Canetti, Yehuda Lindell, Rafail Ostrovsky, Ami...
VLDB
2007
ACM
159views Database» more  VLDB 2007»
14 years 9 months ago
Example-driven design of efficient record matching queries
Record matching is the task of identifying records that match the same real world entity. This is a problem of great significance for a variety of business intelligence applicatio...
Surajit Chaudhuri, Bee-Chung Chen, Venkatesh Ganti...
LICS
2008
IEEE
14 years 3 months ago
From Automatic Structures to Borel Structures
We study the classes of B¨uchi and Rabin automatic structures. For B¨uchi (Rabin) automatic structures their domains consist of infinite strings (trees), and the basic relation...
Greg Hjorth, Bakhadyr Khoussainov, Antonio Montalb...
ICDM
2006
IEEE
164views Data Mining» more  ICDM 2006»
14 years 3 months ago
Unsupervised Learning of Tree Alignment Models for Information Extraction
We propose an algorithm for extracting fields from HTML search results. The output of the algorithm is a database table– a data structure that better lends itself to high-level...
Philip Zigoris, Damian Eads, Yi Zhang