Sciweavers

516 search results - page 52 / 104
» Sets of k-Independent Strings
Sort
View
ALT
2010
Springer
13 years 10 months ago
Towards General Algorithms for Grammatical Inference
Many algorithms for grammatical inference can be viewed as instances of a more general algorithm which maintains a set of primitive elements, which distributionally define sets of ...
Alexander Clark
CRYPTO
2006
Springer
111views Cryptology» more  CRYPTO 2006»
14 years 14 days ago
Tight Bounds for Unconditional Authentication Protocols in the Manual Channel and Shared Key Models
We address the message authentication problem in two seemingly different communication models. In the first model, the sender and receiver are connected by an insecure channel and...
Moni Naor, Gil Segev, Adam Smith
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...