Sciweavers

185 search results - page 16 / 37
» Efficiently computing private recommendations
Sort
View
HPCA
2009
IEEE
14 years 7 months ago
Adaptive Spill-Receive for robust high-performance caching in CMPs
In a Chip Multi-Processor (CMP) with private caches, the last level cache is statically partitioned between all the cores. This prevents such CMPs from sharing cache capacity in r...
Moinuddin K. Qureshi
STOC
2000
ACM
137views Algorithms» more  STOC 2000»
13 years 10 months ago
On the complexity of verifiable secret sharing and multiparty computation
We first study the problem of doing Verifiable Secret Sharing (VSS) information theoretically secure for a general access structure. We do it in the model where private channels b...
Ronald Cramer, Ivan Damgård, Stefan Dziembow...
JOC
2010
123views more  JOC 2010»
13 years 1 months ago
Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries
Abstract. In the setting of secure multiparty computation, a set of mutually distrustful parties wish to securely compute some joint function of their private inputs. The computati...
Yonatan Aumann, Yehuda Lindell
HICSS
2006
IEEE
138views Biometrics» more  HICSS 2006»
14 years 23 days ago
An Efficient Algorithm for Real-Time Frequent Pattern Mining for Real-Time Business Intelligence Analytics
Finding frequent patterns from databases has been the most time consuming process in data mining tasks, like association rule mining. Frequent pattern mining in real-time is of in...
Rajanish Dass, Ambuj Mahanti
HICSS
2005
IEEE
164views Biometrics» more  HICSS 2005»
14 years 10 days ago
An Efficient Technique for Frequent Pattern Mining in Real-Time Business Applications
Association rule mining in real-time is of increasing thrust in many business applications. Applications such as e-commerce, recommender systems, supply-chain management and group...
Rajanish Dass, Ambuj Mahanti