Sciweavers

5214 search results - page 9 / 1043
» The Online Specialization Problem
Sort
View
SODA
2004
ACM
104views Algorithms» more  SODA 2004»
13 years 8 months ago
Tight bounds for the partial-sums problem
We close the gaps between known lower and upper bounds for the online partial-sums problem in the RAM and group models of computation. If elements are chosen from an abstract grou...
Mihai Patrascu, Erik D. Demaine
SIGMOD
2006
ACM
170views Database» more  SIGMOD 2006»
14 years 7 months ago
COLT: continuous on-line tuning
Self-tuning is a cost-effective and elegant solution to the important problem of configuring a database to the characteristics of the query load. Existing techniques operate in an...
Karl Schnaitter, Serge Abiteboul, Tova Milo, Neokl...
ICDE
2008
IEEE
195views Database» more  ICDE 2008»
14 years 8 months ago
LOCUST: An Online Analytical Processing Framework for High Dimensional Classification of Data Streams
Abstract-- In recent years, data streams have become ubiquitous because of advances in hardware and software technology. The ability to adapt conventional mining problems to data s...
Charu C. Aggarwal, Philip S. Yu
IC
2000
13 years 8 months ago
Advanced Techniques for Analyzing Web Server Logs
This paper gives an account of the practical experiences made in generating special statistical information of web server logs. It emphasizes the problem of combining different dat...
Ernst Georg Haffner, Uwe Roth, Andreas Heuer 0002,...
WEA
2007
Springer
87views Algorithms» more  WEA 2007»
14 years 1 months ago
Algorithms for Longer OLED Lifetime
Abstract. We consider an optimization problem arising in the design of controllers for OLED displays. Our objective is to minimize the amplitude of the electrical current flowing ...
Friedrich Eisenbrand, Andreas Karrenbauer, Chihao ...