Sciweavers

348 search results - page 60 / 70
» Event tree based sampling
Sort
View
ICCV
2009
IEEE
16 years 2 months ago
Semi-Supervised Random Forests
Random Forests (RFs) have become commonplace in many computer vision applications. Their popularity is mainly driven by their high computational efficiency during both training ...
Christian Leistner, Amir Saffari, Jakob Santner, H...
ECCV
2000
Springer
15 years 11 months ago
Non-parametric Model for Background Subtraction
Abstract. Background subtraction is a method typically used to segment moving regions in image sequences taken from a static camera by comparing each new frame to a model of the sc...
Ahmed M. Elgammal, David Harwood, Larry S. Davis
SIGSOFT
2007
ACM
15 years 10 months ago
Towards incremental adaptive covering arrays
The increasing complexity of configurable software systems creates a need for more intelligent sampling mechanisms to detect and locate failure-inducing dependencies between confi...
Adam A. Porter, Myra B. Cohen, Sandro Fouché...
STOC
2001
ACM
134views Algorithms» more  STOC 2001»
15 years 10 months ago
Fully-dynamic min-cut
We show that we can maintain up to polylogarithmic edge connectivity for a fully-dynamic graph in ~O(pn) time per edge insertion or deletion. Within logarithmic factors, this matc...
Mikkel Thorup
VLDB
2004
ACM
119views Database» more  VLDB 2004»
15 years 10 months ago
Evaluating holistic aggregators efficiently for very large datasets
Indatawarehousingapplications,numerousOLAP queries involve the processing of holistic aggregators such as computing the "top n," median, quantiles, etc. In this paper, we...
Lixin Fu, Sanguthevar Rajasekaran