Sciweavers

1228 search results - page 85 / 246
» Continuations, proofs and tests
Sort
View
ICMLA
2003
13 years 9 months ago
Fast Class-Attribute Interdependence Maximization (CAIM) Discretization Algorithm
– Discretization is a process of converting a continuous attribute into an attribute that contains small number of distinct values. One of the major reasons for discretizing an a...
Lukasz A. Kurgan, Krzysztof J. Cios
LICS
2003
IEEE
14 years 1 months ago
New Directions in Instantiation-Based Theorem Proving
We consider instantiation-based theorem proving whereby instances of clauses are generated by certain inferences, and where inconsistency is detected by propositional tests. We gi...
Harald Ganzinger, Konstantin Korovin
STOC
1992
ACM
110views Algorithms» more  STOC 1992»
14 years 4 days ago
Linear Decision Trees: Volume Estimates and Topological Bounds
Abstract. We describe two methods for estimating the size and depth of decision trees where a linear test is performed at each node. Both methods are applied to the question of dec...
Anders Björner, László Lov&aacu...
CIE
2006
Springer
13 years 11 months ago
On Graph Isomorphism for Restricted Graph Classes
Abstract. Graph isomorphism (GI) is one of the few remaining problems in NP whose complexity status couldn't be solved by classifying it as being either NP-complete or solvabl...
Johannes Köbler

Lecture Notes
561views
15 years 7 months ago
Financial Econometrics
These notes cover several topics such as Review of Statistics, Least Squares and Maximum Likelihood Estimation, Index Models, Testing CAPM and Multifactor Models Event Studies, Ti...
Paul Söderlind