Sciweavers

1772 search results - page 238 / 355
» Classifying Problems into Complexity Classes
Sort
View
SAC
2005
ACM
15 years 6 months ago
Learning decision trees from dynamic data streams
: This paper presents a system for induction of forest of functional trees from data streams able to detect concept drift. The Ultra Fast Forest of Trees (UFFT) is an incremental a...
João Gama, Pedro Medas, Pedro Pereira Rodri...
138
Voted
EMNLP
2010
14 years 10 months ago
Learning Recurrent Event Queries for Web Search
Recurrent event queries (REQ) constitute a special class of search queries occurring at regular, predictable time intervals. The freshness of documents ranked for such queries is ...
Ruiqiang Zhang, Yuki Konda, Anlei Dong, Pranam Kol...
79
Voted
CVPR
2004
IEEE
16 years 2 months ago
Detecting Unusual Activity in Video
We present an unsupervised technique for detecting unusual activity in a large video set using many simple features. No complex activity models and no supervised feature selection...
Hua Zhong, Jianbo Shi, Mirkó Visontai
99
Voted
GECCO
2005
Springer
162views Optimization» more  GECCO 2005»
15 years 6 months ago
An autonomous explore/exploit strategy
In reinforcement learning problems it has been considered that neither exploitation nor exploration can be pursued exclusively without failing at the task. The optimal balance bet...
Alex McMahon, Dan Scott, William N. L. Browne
AVSS
2006
IEEE
15 years 4 months ago
Classification-Based Likelihood Functions for Bayesian Tracking
The success of any Bayesian particle filtering based tracker relies heavily on the ability of the likelihood function to discriminate between the state that fits the image well an...
Chunhua Shen, Hongdong Li, Michael J. Brooks