Sciweavers

1439 search results - page 198 / 288
» Fast approximation of centrality
Sort
View
CVPR
2012
IEEE
13 years 3 months 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
138
Voted
SDM
2012
SIAM
224views Data Mining» more  SDM 2012»
13 years 3 months 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
13 years 3 months 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
131
Voted
DASFAA
2008
IEEE
190views Database» more  DASFAA 2008»
15 years 7 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...
108
Voted
SIGMOD
2008
ACM
140views Database» more  SIGMOD 2008»
15 years 17 days 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...