Sciweavers

6881 search results - page 1014 / 1377
» Motivation
Sort
View
TCC
2009
Springer
184views Cryptology» more  TCC 2009»
16 years 7 months ago
Secure Arithmetic Computation with No Honest Majority
We study the complexity of securely evaluating arithmetic circuits over finite rings. This question is motivated by natural secure computation tasks. Focusing mainly on the case o...
Yuval Ishai, Manoj Prabhakaran, Amit Sahai
201
Voted
TCC
2009
Springer
169views Cryptology» more  TCC 2009»
16 years 7 months ago
Goldreich's One-Way Function Candidate and Myopic Backtracking Algorithms
Abstract. Goldreich (ECCC 2000) proposed a candidate one-way function construction which is parameterized by the choice of a small predicate (over d = O(1) variables) and of a bipa...
James Cook, Omid Etesami, Rachel Miller, Luca Trev...
TCC
2009
Springer
142views Cryptology» more  TCC 2009»
16 years 7 months ago
Chosen-Ciphertext Security via Correlated Products
We initiate the study of one-wayness under correlated products. We are interested in identifying necessary and sufficient conditions for a function f and a distribution on inputs ...
Alon Rosen, Gil Segev
KDD
2009
ACM
192views Data Mining» more  KDD 2009»
16 years 7 months ago
Learning optimal ranking with tensor factorization for tag recommendation
Tag recommendation is the task of predicting a personalized list of tags for a user given an item. This is important for many websites with tagging capabilities like last.fm or de...
Steffen Rendle, Leandro Balby Marinho, Alexandros ...
KDD
2009
ACM
156views Data Mining» more  KDD 2009»
16 years 7 months ago
Multi-focal learning and its application to customer service support
In this study, we formalize a multi-focal learning problem, where training data are partitioned into several different focal groups and the prediction model will be learned within...
Yong Ge, Hui Xiong, Wenjun Zhou, Ramendra K. Sahoo...
« Prev « First page 1014 / 1377 Last » Next »