986 search results - page 150 / 198 » Algorithmic Lower Bounds for Problems Parameterized by Cliqu... |
COLT
2010
Springer
13 years 5 months ago
2010
Springer
We consider the problem of planning in a stochastic and discounted environment with a limited numerical budget. More precisely, we investigate strategies exploring the set of poss...
STOC
2001
ACM
14 years 8 months ago
2001
ACM
We study the problem of finding an outlier-free subset of a set of points (or a probability distribution) in n-dimensional Euclidean space. As in [BFKV 99], a point x is defined t...
KDD
2012
ACM
11 years 10 months ago
2012
ACM
Most time series data mining algorithms use similarity search as a core subroutine, and thus the time taken for similarity search is the bottleneck for virtually all time series d...
ANCS
2005
ACM
14 years 1 months ago
2005
ACM
We present Group Round-Robin (GRR) scheduling, a hybrid fair packet scheduling framework based on a grouping strategy that narrows down the traditional trade-off between fairness ...
ICCV
2005
IEEE
14 years 1 months ago
2005
IEEE
This paper addresses one of the fundamental problems encountered in performance prediction for object recognition. In particular we address the problems related to estimation of s...