Sciweavers

2925 search results - page 3 / 585
» Information Complexity of Online Problems
Sort
View
ALGORITHMICA
2004
65views more  ALGORITHMICA 2004»
13 years 9 months ago
On-Line Dial-a-Ride Problems Under a Restricted Information Model
Maarten Lipmann, Xiwen Lu, Willem de Paepe, Ren&ea...
WWW
2008
ACM
14 years 10 months ago
First workshop on targeting and ranking for online advertising
Online advertising is a rapidly growing, multi-billion dollar industry. It has become a significant element of the Web browsing experience. Ad platforms used for ad selection use ...
Ewa Dominowska, Vanja Josifovski
ICIP
2007
IEEE
14 years 4 months ago
Energetic Particle Filter for Online Multiple Target Tracking
Online target tracking requires to solve two problems: data association and online dynamic estimation. Usually, association effectiveness is based on prior information and observa...
Abir El Abed, Séverine Dubuisson, Dominique...
CSFW
2011
IEEE
12 years 9 months ago
The Complexity of Quantitative Information Flow Problems
—In this paper, we investigate the computational complexity of quantitative information flow (QIF) problems. Information-theoretic quantitative relaxations of noninterference (b...
Pavol Cerný, Krishnendu Chatterjee, Thomas ...