2487 search results - page 427 / 498 » cases 2009 |
105
Voted
TCC
2009
Springer
16 years 1 months ago
2009
Springer
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...
98
Voted
TCC
2009
Springer
16 years 1 months ago
2009
Springer
The concept of witness-hiding suggested by Feige and Shamir is a natural relaxation of zero-knowledge. In this paper we identify languages and distributions for which many known co...
110
Voted
TCC
2009
Springer
16 years 1 months ago
2009
Springer
In the setting of secure computation, a set of parties wish to securely compute some function of their inputs, in the presence of an adversary. The adversary in question may be st...
127
click to vote
KDD
2009
ACM
16 years 1 months ago
2009
ACM
Active and semi-supervised learning are important techniques when labeled data are scarce. Recently a method was suggested for combining active learning with a semi-supervised lea...
120
Voted
KDD
2009
ACM
16 years 1 months ago
2009
ACM
Recently many data types arising from data mining and Web search applications can be modeled as bipartite graphs. Examples include queries and URLs in query logs, and authors and ...