Sciweavers

5214 search results - page 92 / 1043
» The Online Specialization Problem
Sort
View
ICDE
2009
IEEE
149views Database» more  ICDE 2009»
14 years 10 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
SWAT
2010
Springer
279views Algorithms» more  SWAT 2010»
14 years 2 months ago
Online Function Tracking with Generalized Penalties
We attend to the classic setting where an observer needs to inform a tracker about an arbitrary time varying function f : N0 → Z. This is an optimization problem, where both wron...
Marcin Bienkowski, Stefan Schmid
COCOON
2001
Springer
14 years 1 months ago
Competitive Online Scheduling with Level of Service
d by an application in thinwire visualization, we study an abstract on-line scheduling problem where the size of each requested service can be scaled down by the scheduler. Thus o...
Ee-Chien Chang, Chee-Keng Yap
PERCOM
2006
ACM
14 years 8 months ago
Online Routing in Quasi-Planar and Quasi-Polyhedral Graphs
We address the problem of online route discovery for a class of graphs that can be embedded either in two or in three dimensional space. In two dimensions we propose the class of ...
Evangelos Kranakis, Tim Mott, Ladislav Stacho
ESANN
2006
13 years 10 months ago
Construction of a memory management system in an on-line learning mechanism
This paper is the first of a two paper series that deals with an important problem in on-line learning mechanisms for autonomous agents that must perform non trivial tasks and oper...
Francisco Bellas, José Antonio Becerra, Ric...