5606 search results - page 885 / 1122 » Randomization Techniques for Graphs. |
158
click to vote
SSS
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We present schemes for providing anonymous transactions while privacy and anonymity are preserved, providing user anonymous authentication in distributed networks such as...
216
click to vote
SIGMETRICS
2009
ACM
16 years 1 months ago
2009
ACM
Disseminating a piece of information, or updates for a piece of information, has been shown to benefit greatly from simple randomized procedures, sometimes referred to as gossipi...
171
click to vote
FOCS
2008
IEEE
16 years 1 months ago
2008
IEEE
Razborov and Rudich have shown that so-called natural proofs are not useful for separating P from NP unless hard pseudorandom number generators do not exist. This famous result is...
157
click to vote
FOCS
2007
IEEE
16 years 27 days ago
2007
IEEE
In STOC’05, Ahn, Hopper and Langford introduced the notion of covert computation. A covert computation protocol is one in which parties can run a protocol without knowing if oth...
196
click to vote
IJCNN
2007
IEEE
16 years 26 days ago
2007
IEEE
Abstract— The generalised linear model (GLM) is the standard approach in classical statistics for regression tasks where it is appropriate to measure the data misfit using a lik...