Sciweavers

2925 search results - page 100 / 585
» Information Complexity of Online Problems
Sort
View
COLT
2005
Springer
15 years 8 months ago
From External to Internal Regret
External regret compares the performance of an online algorithm, selecting among N actions, to the performance of the best of those actions in hindsight. Internal regret compares ...
Avrim Blum, Yishay Mansour
LWA
2008
15 years 7 months ago
Towards CoPing with Information Overload
The problem of information overload has been addressed by several systems. However, many approaches are limited to informal artifacts and need to refer to the user for reference o...
Christine Müller
FOCS
1997
IEEE
15 years 10 months ago
Replication is NOT Needed: SINGLE Database, Computationally-Private Information Retrieval
d abstract) Eyal Kushilevitz Rafail Ostrovskyy Technion Bellcore We establish the following, quite unexpected, result: replication of data for the computational Private Informatio...
Eyal Kushilevitz, Rafail Ostrovsky
ICS
2010
Tsinghua U.
15 years 10 months ago
Robust Perfect Revenue From Perfectly Informed Players
: Maximizing revenue in the presence of perfectly informed players is a well known goal in mechanism design. Yet, all current mechanisms for this goal are vulnerable to equilibrium...
Jing Chen, Avinatan Hassidim, Silvio Micali
NAACL
2003
15 years 7 months ago
TIPS: A Translingual Information Processing System
Searching online information is increasingly a daily activity for many people. The multilinguality of online content is also increasing (e.g. the proportion of English web users, ...
Yaser Al-Onaizan, Radu Florian, Martin Franz, Hany...