Sciweavers

588 search results - page 4 / 118
» Reducibility and Completeness in Private Computations
Sort
View
ICICS
2005
Springer
14 years 29 days ago
Private Itemset Support Counting
Private itemset support counting (PISC) is a basic building block of various privacy-preserving data mining algorithms. Briefly, in PISC, Client wants to know the support of her i...
Sven Laur, Helger Lipmaa, Taneli Mielikäinen
DBSEC
2010
101views Database» more  DBSEC 2010»
13 years 9 months ago
Generalizing PIR for Practical Private Retrieval of Public Data
Private retrieval of public data is useful when a client wants to query a public data service without revealing the specific query data to the server. Computational Private Informa...
Shiyuan Wang, Divyakant Agrawal, Amr El Abbadi
TC
2002
13 years 7 months ago
Performance Modeling and Prediction of Nondedicated Network Computing
The low cost and wide availability of networks of workstations have made them an attractive solution for high performance computing. However, while a network of workstations may be...
Linguo Gong, Xian-He Sun, Edward F. Watson
ICPP
2008
IEEE
14 years 1 months ago
Scalable Techniques for Transparent Privatization in Software Transactional Memory
—We address the recently recognized privatization problem in software transactional memory (STM) runtimes, and introduce the notion of partially visible reads (PVRs) to heuristic...
Virendra J. Marathe, Michael F. Spear, Michael L. ...
DATE
2005
IEEE
106views Hardware» more  DATE 2005»
14 years 1 months ago
SAT-Based Complete Don't-Care Computation for Network Optimization
This paper describes an improved approach to Boolean network optimization using internal don’t-cares. The improvements concern the type of don’t-cares computed, their scope, a...
Alan Mishchenko, Robert K. Brayton