Sciweavers

185 search results - page 19 / 37
» Efficiently computing private recommendations
Sort
View
TCOS
2010
13 years 2 months ago
Green Secure Processors: Towards Power-Efficient Secure Processor Design
With the increasing wealth of digital information stored on computer systems today, security issues have become increasingly important. In addition to attacks targeting the softwar...
Siddhartha Chhabra, Yan Solihin
CONEXT
2008
ACM
13 years 9 months ago
ISP-friendly peer matching without ISP collaboration
In peer-to-peer (P2P) systems, a receiver needs to be matched with multiple senders, because peers have limited capacity and reliability. Efficient peer matching can reduce the co...
Cheng-Hsin Hsu, Mohamed Hefeeda
NIPS
2008
13 years 8 months ago
One sketch for all: Theory and Application of Conditional Random Sampling
Conditional Random Sampling (CRS) was originally proposed for efficiently computing pairwise (l2, l1) distances, in static, large-scale, and sparse data. This study modifies the o...
Ping Li, Kenneth Ward Church, Trevor Hastie
CAINE
2009
13 years 5 months ago
Clustering Customer Transactions: A Rough Set Based Approach
An efficient customer behavior analysis is important for good Recommender System. Customer transaction clustering is usually the first step towards the analysis of customer behavi...
Arunava Saha, Darsana Das, Dipanjan Karmakar, Dili...
HPDC
2010
IEEE
13 years 8 months ago
Mendel: efficiently verifying the lineage of data modified in multiple trust domains
Data is routinely created, disseminated, and processed in distributed systems that span multiple administrative domains. To maintain accountability while the data is transformed b...
Ashish Gehani, Minyoung Kim