1765 search results - page 196 / 353 » Combinations of Weak Classifiers |
136
click to vote
FUIN
2006
15 years 4 months ago
2006
Abstract. This paper describes an attempt to combine theorem proving and model-checking to formally verify real-time systems in a discrete time setting. The Timed Automata Modeling...
139
click to vote
AUTOMATICA
2004
15 years 4 months ago
2004
Ellipsoidal outer-bounding of the set of all feasible state vectors under model uncertainty is a natural extension of state estimation for deterministic models with unknown-but-bo...
138
click to vote
IR
2010
15 years 2 months ago
2010
Abstract We present a new ranking algorithm that combines the strengths of two previous methods: boosted tree classification, and LambdaRank, which has been shown to be empiricall...
120
click to vote
ASIACRYPT
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. In this paper we combine a recent rotational cryptanalysis with the rebound attack, which results in the best cryptanalysis of Skein, a candidate for the SHA-3 competitio...
143
click to vote
FLAIRS
2009
15 years 2 months ago
2009
Belief revision always results in trusting new evidence, so it may admit an unreliable one and discard a more confident one. We therefore use belief change instead of belief revis...