Sciweavers

181 search results - page 8 / 37
» Online promise problems with online width metrics
Sort
View
DEXA
2008
Springer
120views Database» more  DEXA 2008»
13 years 9 months ago
Compressing Very Large Database Workloads for Continuous Online Index Selection
The paper presents a novel method for compressing large database workloads for purpose of autonomic, continuous index selection. The compressed workload contains a small subset of ...
Piotr Kolaczkowski
JAIR
2008
130views more  JAIR 2008»
13 years 7 months ago
Online Planning Algorithms for POMDPs
Partially Observable Markov Decision Processes (POMDPs) provide a rich framework for sequential decision-making under uncertainty in stochastic domains. However, solving a POMDP i...
Stéphane Ross, Joelle Pineau, Sébast...
ECCV
2008
Springer
14 years 9 months ago
Robust Visual Tracking Based on an Effective Appearance Model
Most existing appearance models for visual tracking usually construct a pixel-based representation of object appearance so that they are incapable of fully capturing both global an...
Xi Li, Weiming Hu, Zhongfei Zhang, Xiaoqin Zhang
SWAT
2010
Springer
282views Algorithms» more  SWAT 2010»
14 years 18 days ago
Better Bounds on Online Unit Clustering
Unit Clustering is the problem of dividing a set of points from a metric space into a minimal number of subsets such that the points in each subset are enclosable by a unit ball. W...
Martin R. Ehmsen, Kim S. Larsen
ICALP
2003
Springer
14 years 23 days ago
A Competitive Algorithm for the General 2-Server Problem
We consider the general on-line two server problem in which at each step both servers receive a request, which is a point in a metric space. One of the servers has to be moved to i...
René Sitters, Leen Stougie, Willem de Paepe