Sciweavers

376 search results - page 12 / 76
» On the Advice Complexity of Online Problems
Sort
View
110
Voted
WWW
2008
ACM
16 years 10 days 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
ICDE
2009
IEEE
149views Database» more  ICDE 2009»
16 years 1 months ago
Online Tuning of Aggregation Tables for OLAP
Materializing results from complex aggregation queries helps to significantly improve response times in OLAP servers. This problem is known as the view selection problem: choosing ...
Katja Hose, Daniel Klan, Kai-Uwe Sattler
101
Voted
SPAA
2004
ACM
15 years 5 months ago
Online algorithms for network design
This paper presents the first polylogarithmic-competitive online algorithms for two-metric network design problems. These problems arise naturally in the design of computer netwo...
Adam Meyerson
85
Voted
ICDM
2008
IEEE
142views Data Mining» more  ICDM 2008»
15 years 6 months ago
Clustering Events on Streams Using Complex Context Information
Monitoring applications play an increasingly important role in many domains. They detect events in monitored systems and take actions such as invoke a program or notify an adminis...
YongChul Kwon, Wing Yee Lee, Magdalena Balazinska,...
100
Voted
ECAI
2004
Springer
15 years 5 months ago
On-Line Search for Solving Markov Decision Processes via Heuristic Sampling
In the past, Markov Decision Processes (MDPs) have become a standard for solving problems of sequential decision under uncertainty. The usual request in this framework is the compu...
Laurent Péret, Frédérick Garc...