Sciweavers

438 search results - page 47 / 88
» The forest hiding problem
Sort
View
ICASSP
2008
IEEE
15 years 6 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
IEEEIAS
2008
IEEE
15 years 6 months ago
Ensemble of One-Class Classifiers for Network Intrusion Detection System
To achieve high accuracy while lowering false alarm rates are major challenges in designing an intrusion detection system. In addressing this issue, this paper proposes an ensembl...
Anazida Zainal, Mohd Aizaini Maarof, Siti Mariyam ...
TPHOL
2008
IEEE
15 years 6 months ago
Certifying a Termination Criterion Based on Graphs, without Graphs
Although graphs are very common in computer science, they are still very difficult to handle for proof assistants as proving properties of graphs may require heavy computations. T...
Pierre Courtieu, Julien Forest, Xavier Urbain
CRV
2007
IEEE
145views Robotics» more  CRV 2007»
15 years 6 months ago
Can Lucas-Kanade be used to estimate motion parallax in 3D cluttered scenes?
When an observer moves in a 3D static scene, the motion field depends on the depth of the visible objects and on the observer’s instantaneous translation and rotation. By compu...
Vincent Chapdelaine-Couture, Michael S. Langer
FOCS
2006
IEEE
15 years 5 months ago
Inclusion--Exclusion Algorithms for Counting Set Partitions
Given an n-element set U and a family of subsets S ⊆ 2U we show how to count the number of k-partitions S1 ∪ · · · ∪ Sk = U into subsets Si ∈ S in time 2nnO(1). The only...
Andreas Björklund, Thore Husfeldt