Sciweavers

1439 search results - page 198 / 288
» Fast approximation of centrality
Sort
View
CVPR
2012
IEEE
12 years 14 days ago
Real time robust L1 tracker using accelerated proximal gradient approach
Recently sparse representation has been applied to visual tracker by modeling the target appearance using a sparse approximation over a template set, which leads to the so-called ...
Chenglong Bao, Yi Wu, Haibin Ling, Hui Ji
SDM
2012
SIAM
224views Data Mining» more  SDM 2012»
12 years 13 days ago
Nearest-Neighbor Search on a Time Budget via Max-Margin Trees
Many high-profile applications pose high-dimensional nearest-neighbor search problems. Yet, it still remains difficult to achieve fast query times for state-of-the-art approache...
Parikshit Ram, Dongryeol Lee, Alexander G. Gray
AAAI
2012
12 years 13 days ago
Kernel-Based Reinforcement Learning on Representative States
Markov decision processes (MDPs) are an established framework for solving sequential decision-making problems under uncertainty. In this work, we propose a new method for batchmod...
Branislav Kveton, Georgios Theocharous
DASFAA
2008
IEEE
190views Database» more  DASFAA 2008»
14 years 4 months ago
Analysis of Time Series Using Compact Model-Based Descriptions
Abstract. Recently, we have proposed a novel method for the compression of time series based on mathematical models that explore dependencies between different time series. This r...
Hans-Peter Kriegel, Peer Kröger, Alexey Pryak...
SIGMOD
2008
ACM
140views Database» more  SIGMOD 2008»
13 years 10 months ago
Near-optimal algorithms for shared filter evaluation in data stream systems
We consider the problem of evaluating multiple overlapping queries defined on data streams, where each query is a conjunction of multiple filters and each filter may be shared acr...
Zhen Liu, Srinivasan Parthasarathy 0002, Anand Ran...