928 search results - page 140 / 186 » The degree structure of Weihrauch-reducibility |
108
Voted
EUROCRYPT
2009
Springer
16 years 1 months ago
2009
Springer
Almost any cryptographic scheme can be described by tweakable polynomials over GF(2), which contain both secret variables (e.g., key bits) and public variables (e.g., plaintext bit...
95
Voted
PODC
2009
ACM
16 years 1 months ago
2009
ACM
We present a randomized coloring algorithm for the unstructured radio network model, a model comprising autonomous nodes, asynchronous wake-up, no collision detection and an unkno...
129
Voted
KDD
2009
ACM
16 years 1 months ago
2009
ACM
Nowadays, enormous amounts of data are continuously generated not only in massive scale, but also from different, sometimes conflicting, views. Therefore, it is important to conso...
116
Voted
KDD
2008
ACM
16 years 27 days ago
2008
ACM
Information diffusion, viral marketing, and collective classification all attempt to model and exploit the relationships in a network to make inferences about the labels of nodes....
94
Voted
ICALP
2009
Springer
16 years 23 days ago
2009
Springer
Abstract. We consider the succinct representation of ordinal and cardinal trees on the RAM with logarithmic word size. Given a tree T, our representations support the following ope...