Sciweavers

1414 search results - page 86 / 283
» Randomness and Universal Machines
Sort
View
ESANN
2006
13 years 10 months ago
Random Forests Feature Selection with K-PLS: Detecting Ischemia from Magnetocardiograms
Random Forests were introduced by Breiman for feature (variable) selection and improved predictions for decision tree models. The resulting model is often superior to AdaBoost and ...
Long Han, Mark J. Embrechts, Boleslaw K. Szymanski...
ALT
2008
Springer
14 years 5 months ago
On-Line Probability, Complexity and Randomness
Abstract. Classical probability theory considers probability distributions that assign probabilities to all events (at least in the finite case). However, there are natural situat...
Alexey V. Chernov, Alexander Shen, Nikolai K. Vere...
STOC
2006
ACM
116views Algorithms» more  STOC 2006»
14 years 9 months ago
Linear degree extractors and the inapproximability of max clique and chromatic number
: We derandomize results of H?astad (1999) and Feige and Kilian (1998) and show that for all > 0, approximating MAX CLIQUE and CHROMATIC NUMBER to within n1are NP-hard. We furt...
David Zuckerman
ECTEL
2006
Springer
14 years 13 days ago
COOPER: Towards a Collaborative Open Environment of Project-Centred Learning
Abstract. Nowadays, engineering studies are characterized by high mobility of students, lecturers and workforce and by the dynamics of multinational companies where "classes&q...
Aldo Bongio, Jan van Bruggen, Stefano Ceri, Valent...
ECTEL
2006
Springer
14 years 13 days ago
A Context-Aware Service Oriented Framework for Finding, Recommending and Inserting Learning Objects
In this poster, we will propose a framework for finding, recommending and inserting learning objects in a digital repository level, exploiting the user context that is captured fro...
Xavier Ochoa, Stefaan Ternier, Gonzalo Parra, Erik...