5115 search results - page 597 / 1023 » On Randomized Lanczos Algorithms |
187
click to vote
KDD
2007
ACM
16 years 7 months ago
2007
ACM
Data mining tasks such as supervised classification can often benefit from a large training dataset. However, in many application domains, privacy concerns can hinder the construc...
205
click to vote
STOC
2005
ACM
16 years 7 months ago
2005
ACM
This paper explores what kinds of information two parties must communicate in order to correct errors which occur in a shared secret string W. Any bits they communicate must leak ...
196
click to vote
STOC
2003
ACM
16 years 7 months ago
2003
ACM
This paper provides the first explicit construction of extractors which are simultaneously optimal up to constant factors in both seed length and output length. More precisely, fo...
254
click to vote
SIGMOD
2008
ACM
16 years 6 months ago
2008
ACM
Random sampling is an appealing approach to build synopses of large data streams because random samples can be used for a broad spectrum of analytical tasks. Users are often inter...
190
click to vote
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
—The performance of randomized network coding can suffer significantly when malicious nodes corrupt the content of the exchanged blocks. Previous work have introduced error corr...