Sciweavers

502 search results - page 30 / 101
» Streaming Random Forests
Sort
View
AMC
2004
79views more  AMC 2004»
13 years 10 months ago
Computational experience with exterior point algorithms for the transportation problem
An experimental computational study to compare the classical primal simplex algorithm and the exterior point algorithms for the transportation problem (TP) is presented. Totally, ...
Charalampos Papamanthou, Konstantinos Paparrizos, ...
SSDBM
2007
IEEE
104views Database» more  SSDBM 2007»
14 years 4 months ago
Reservoir Sampling over Memory-Limited Stream Joins
In stream join processing with limited memory, uniform random sampling is useful for approximate query evaluation. In this paper, we address the problem of reservoir sampling over...
Mohammed Al-Kateb, Byung Suk Lee, Xiaoyang Sean Wa...
CIVR
2009
Springer
132views Image Analysis» more  CIVR 2009»
14 years 4 months ago
Real-time bag of words, approximately
We start from the state-of-the-art Bag of Words pipeline that in the 2008 benchmarks of TRECvid and PASCAL yielded the best performance scores. We have contributed to that pipelin...
Jasper R. R. Uijlings, Arnold W. M. Smeulders, Rem...
BMCBI
2010
190views more  BMCBI 2010»
13 years 10 months ago
Sample size and statistical power considerations in high-dimensionality data settings: a comparative study of classification alg
Background: Data generated using `omics' technologies are characterized by high dimensionality, where the number of features measured per subject vastly exceeds the number of...
Yu Guo, Armin Graber, Robert N. McBurney, Raji Bal...
ICASSP
2008
IEEE
14 years 4 months ago
A weighted subspace approach for improving bagging performance
Bagging is an ensemble method that uses random resampling of a dataset to construct models. In classification scenarios, the random resampling procedure in bagging induces some c...
Qu-Tang Cai, Chun-Yi Peng, Chang-Shui Zhang