Sciweavers

2925 search results - page 66 / 585
» Information Complexity of Online Problems
Sort
View
CDC
2010
IEEE
164views Control Systems» more  CDC 2010»
15 years 1 months ago
A recursive system identification method based on binary measurements
Abstract-- An online approach to parameter estimation problems based on binary observations is presented in this paper. This recursive identification method relies on a least-mean ...
Kian Jafari, Jérôme Juillard, É...
DIAU
2000
Springer
15 years 9 months ago
Traffic Analysis: Protocols, Attacks, Design Issues, and Open Problems
We present the traffic analysis problem and expose the most important protocols, attacks and design issues. Afterwards, we propose directions for further research. As we are mostl...
Jean-François Raymond
BIRTHDAY
2004
Springer
15 years 11 months ago
Der 'Nietzsche-Thesaurus' des Nietzsche-Online-Portals
The ‚Nietzsche-Thesaurus’ ist part of an Internet-Portal to the German philosopher Friedrich Nietzsche (under construction). By using the complex Index of a Citation Lexicon (...
Harald Zimmermann
AAAI
2007
15 years 8 months ago
Combining Multiple Heuristics Online
We present black-box techniques for learning how to interleave the execution of multiple heuristics in order to improve average-case performance. In our model, a user is given a s...
Matthew J. Streeter, Daniel Golovin, Stephen F. Sm...
WWW
2008
ACM
16 years 6 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