6251 search results - page 1219 / 1251 » Randomness, Computability, and Density |
188
click to vote
SIGECOM
2010
ACM
15 years 10 months 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...
146
click to vote
SIGECOM
2010
ACM
15 years 10 months ago
2010
ACM
We design and analyze approximately revenue-maximizing auctions in general single-parameter settings. Bidders have publicly observable attributes, and we assume that the valuation...
173
Voted
SIGMOD
2010
ACM
15 years 10 months ago
2010
ACM
Online aggregation is a promising solution to achieving fast early responses for interactive ad-hoc queries that compute aggregates on a large amount of data. Essential to the suc...
204
click to vote
EUROCRYPT
2010
Springer
15 years 10 months ago
2010
Springer
This paper revisits the construction of Universal One-Way Hash Functions (UOWHFs) from any one-way function due to Rompel (STOC 1990). We give a simpler construction of UOWHFs, whi...
155
Voted
GECCO
2010
Springer
15 years 10 months ago
2010
Springer
Negative selection algorithms are immune-inspired classifiers that are trained on negative examples only. Classification is performed by generating detectors that match none of ...