Sciweavers

32 search results - page 6 / 7
» Batch Binary Edwards
Sort
View
ML
2002
ACM
135views Machine Learning» more  ML 2002»
13 years 7 months ago
Bayesian Treed Models
When simple parametric models such as linear regression fail to adequately approximate a relationship across an entire set of data, an alternative may be to consider a partition o...
Hugh A. Chipman, Edward I. George, Robert E. McCul...
ASPLOS
2004
ACM
14 years 26 days ago
Secure program execution via dynamic information flow tracking
Dynamic information flow tracking is a hardware mechanism to protect programs against malicious attacks by identifying spurious information flows and restricting the usage of sp...
G. Edward Suh, Jae W. Lee, David Zhang, Srinivas D...
SMC
2007
IEEE
156views Control Systems» more  SMC 2007»
14 years 1 months ago
Dynamic fusion of classifiers for fault diagnosis
—This paper considers the problem of temporally fusing classifier outputs to improve the overall diagnostic classification accuracy in safety-critical systems. Here, we discuss d...
Satnam Singh, Kihoon Choi, Anuradha Kodali, Krishn...
SAC
2005
ACM
14 years 1 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...
SAC
2004
ACM
14 years 26 days ago
Forest trees for on-line data
This paper presents an hybrid adaptive system for induction of forest of trees from data streams. The Ultra Fast Forest Tree system (UFFT) is an incremental algorithm, with consta...
João Gama, Pedro Medas, Ricardo Rocha