2681 search results - page 348 / 537 » Problem F |
267
click to vote
ICDT
2009
ACM
16 years 7 months ago
2009
ACM
We continue the study of approximating the number of distinct elements in a data stream of length n to within a (1? ) factor. It is known that if the stream may consist of arbitra...
224
click to vote
PKC
2000
Springer
15 years 10 months ago
2000
Springer
A number of signature schemes and standards have been recently designed, based on the Discrete Logarithm problem. In this paper we conduct design validation of such schemes while t...
145
click to vote
COLT
2008
Springer
15 years 8 months ago
2008
Springer
Consider the problem of estimating the -level set G = {x : f(x) } of an unknown d-dimensional density function f based on n independent observations X1, . . . , Xn from the densi...
167
click to vote
WWW
2008
ACM
16 years 7 months ago
2008
ACM
We study the Cost-Per-Action or Cost-Per-Acquisition (CPA) charging scheme in online advertising. In this scheme, instead of paying per click, the advertisers pay only when a user...
158
click to vote
WWW
2005
ACM
16 years 7 months ago
2005
ACM
Personalized PageRank expresses backlink-based page quality around user-selected pages in a similar way to PageRank over the entire Web. Algorithms for computing personalized Page...