1923 search results - page 204 / 385 » Weighted Decision Trees |
238
click to vote
CC
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We prove lower bounds on the randomized two-party communication complexity of functions that arise from read-once boolean formulae. A read-once boolean formula is a formu...
192
click to vote
DSN
2009
IEEE
15 years 4 months ago
2009
IEEE
Preserving the availability and integrity of networked computing systems in the face of fast-spreading intrusions requires advances not only in detection algorithms, but also in a...
188
click to vote
PERCOM
2006
ACM
16 years 6 months ago
2006
ACM
The irregularity in quality of wireless communication links poses significant research challenges in wireless sensor network design. Dynamic network conditions and environmental f...
179
click to vote
CANS
2005
Springer
16 years 1 days ago
2005
Springer
Abstract. In this paper, we propose a new unsupervised anomaly detection framework for detecting network intrusions online. The framework consists of new anomalousness metrics name...
175
click to vote
CAV
2010
Springer
15 years 9 months ago
2010
Springer
Often one has a preference order among the different systems that satisfy a given specification. Under a probabilistic assumption about the possible inputs, such a preference order...