Sciweavers

886 search results - page 17 / 178
» On the Autoreducibility of Random Sequences
Sort
View
RSA
2011
124views more  RSA 2011»
13 years 2 months ago
Sparse random graphs with clustering
In 2007 we introduced a general model of sparse random graphs with independence between the edges. The aim of this paper is to present an extension of this model in which the edge...
Béla Bollobás, Svante Janson, Oliver...
ICASSP
2011
IEEE
12 years 11 months ago
Multi-cue based multi-target tracking using online random forests
Discriminative tracking has become popular tracking methods due to their descriptive power for foreground/background separation. Among these methods, online random forest is recen...
Xinchu Shi, Xiaoqin Zhang, Yang Liu, Weiming Hu, H...
TSP
2010
13 years 2 months ago
Universal randomized switching
Abstract--In this paper, we consider a competitive approach to sequential decision problems, suitable for a variety of signal processing applications where at each of a succession ...
Suleyman Serdar Kozat, Andrew C. Singer
ICIP
2009
IEEE
13 years 5 months ago
An incremental extremely random forest classifier for online learning and tracking
Decision trees have been widely used for online learning classification. Many approaches usually need large data stream to finish decision trees induction, as show notable limitat...
Aiping Wang, Guowei Wan, Zhiquan Cheng, Sikun Li
ICASSP
2011
IEEE
12 years 11 months ago
Automatic minute generation for parliamentary speech using conditional random fields
We show a novel approach of automatically generating minutes style extractive summaries for parliamentary speech. Minutes are structured summaries consisting of sequences of busin...
Justin Jian Zhang, Pascale Fung, Ricky Ho Yin Chan