688 search results - page 133 / 138 » General Partitioning on Random Graphs |
SIGECOM
2010
ACM
14 years 5 days ago
2010
ACM
Motivated by the allocation problem facing publishers in display advertising we formulate the online assignment with forecast problem, a version of the online allocation problem w...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Getting agents in the Internet, and in networks in general, to invest in and deploy security features and protocols is a challenge, in particular because of economic reasons arisi...
WWW
2007
ACM
14 years 8 months ago
2007
ACM
Given a large online network of online auction users and their histories of transactions, how can we spot anomalies and auction fraud? This paper describes the design and implemen...
STOC
2007
ACM
14 years 7 months ago
2007
ACM
In this work, we consider the problems of testing whether a distribution over {0, 1}n is k-wise (resp. ( , k)-wise) independent using samples drawn from that distribution. For the...
STOC
2004
ACM
14 years 7 months ago
2004
ACM
We present an explicit construction of codes that can be list decoded from a fraction (1 - ) of errors in sub-exponential time and which have rate / logO(1) (1/). This comes close...