5100 search results - page 773 / 1020 » The Linear Complexity of a Graph |
176
click to vote
TCC
2009
Springer
16 years 7 months ago
2009
Springer
Proofs of Retrievability (PoR), introduced by Juels and Kaliski [JK07], allow the client to store a file F on an untrusted server, and later run an efficient audit protocol in whi...
163
click to vote
KDD
2002
ACM
16 years 7 months ago
2002
ACM
Covariance and correlation estimates have important applications in data mining. In the presence of outliers, classical estimates of covariance and correlation matrices are not re...
156
click to vote
STOC
2006
ACM
16 years 6 months ago
2006
ACM
d abstract) Yuval Ishai Eyal Kushilevitz Yehuda Lindell Erez Petrank It is well known that the secure computation of non-trivial functionalities in the setting of no honest majori...
198
click to vote
SIGMOD
2003
ACM
16 years 6 months ago
2003
ACM
The learning-enhanced relevance feedback has been one of the most active research areas in content-based image retrieval in recent years. However, few methods using the relevance ...
168
click to vote
TCC
2007
Springer
16 years 19 days ago
2007
Springer
Abstract. Parallel repetition is well known to reduce the error probability at an exponential rate for single- and multi-prover interactive proofs. Bellare, Impagliazzo and Naor (1...