267 search results - page 17 / 54 » Online Auctions: There Can Be Only One |
SIGECOM
2009
ACM
15 years 6 months ago
2009
ACM
We study the problem of how to allocate m identical items among n > m agents, assuming each agent desires exactly one item and has a private value for consuming the item. We as...
ITCC
2005
IEEE
15 years 5 months ago
2005
IEEE
Even though passwords are the most convenient means of authentication, they bring along themselves the threat of dictionary attacks. Dictionary attacks may be of two kinds: online...
CORR
2010
Springer
14 years 12 months ago
2010
Springer
We study online learning when individual instances are corrupted by adversarially chosen random noise. We assume the noise distribution is unknown, and may change over time with n...
ARITH
2001
IEEE
15 years 3 months ago
2001
IEEE
This paper demonstrates the advantages of using on-line arithmetic for traditional and advanced detection algorithms for communication systems. Detection is one of the core comput...
ICML
2010
IEEE
15 years 26 days ago
2010
IEEE
In this paper, we investigate a new machine learning framework called Online Transfer Learning (OTL) that aims to transfer knowledge from some source domain to an online learning ...