876 search results - page 22 / 176 » Limits on the Usefulness of Random Oracles |
70
Voted
SIGSOFT
2007
ACM
16 years 1 months ago
2007
ACM
We improve on previous recommender systems by taking advantage of the layered structure of software. We use a random-walk approach, mimicking the more focused behavior of a develo...
77
Voted
DCG
2000
15 years 14 days ago
2000
Points P1, . . . , Pn in the unit square define a convex n-chain if they are below y = x and, together with P0 = (0, 0) and Pn+1 = (1, 1), they are in convex position. Under unifo...
120
click to vote
CISC
2008
Springer
15 years 2 months ago
2008
Springer
One of the important applications of digital signature is anonymous credential or pseudonym system. In these scenarios, it is essential that the identity of the signer is kept secr...
ESA
2008
Springer
15 years 2 months ago
2008
Springer
The focus is on black-box optimization of a function f : RN R given as a black box, i. e. an oracle for f-evaluations. This is commonly called direct search, and in fact, most meth...
103
click to vote
GLOBECOM
2007
IEEE
15 years 7 months ago
2007
IEEE
— A relay selection approach has previously been shown to outperform repetition-based scheduling for both amplify-and-forward (AF) and decode-and-forward (DF) cooperative network...