Sciweavers

4377 search results - page 682 / 876
» Mass problems and randomness
Sort
View
WWW
2008
ACM
16 years 7 months ago
Dynamic cost-per-action mechanisms and applications to online advertising
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...
Hamid Nazerzadeh, Amin Saberi, Rakesh Vohra
WWW
2006
ACM
16 years 7 months ago
Communities from seed sets
Expanding a seed set into a larger community is a common procedure in link-based analysis. We show how to adapt recent results from theoretical computer science to expand a seed s...
Reid Andersen, Kevin J. Lang
WWW
2004
ACM
16 years 7 months ago
Type based service composition
Service matchmaking and composition has recently drawn increasing attention in the research community. Most existing algorithms construct chains of services based on exact matches...
Ion Constantinescu, Boi Faltings, Walter Binder
TCC
2009
Springer
146views Cryptology» more  TCC 2009»
16 years 6 months ago
An Optimally Fair Coin Toss
We address one of the foundational problems in cryptography: the bias of coin-flipping protocols. Coin-flipping protocols allow mutually distrustful parties to generate a common u...
Tal Moran, Moni Naor, Gil Segev
KDD
2009
ACM
156views Data Mining» more  KDD 2009»
16 years 6 months ago
Collusion-resistant anonymous data collection method
The availability and the accuracy of the data dictate the success of a data mining application. Increasingly, there is a need to resort to on-line data collection to address the p...
Mafruz Zaman Ashrafi, See-Kiong Ng