Sciweavers

2252 search results - page 64 / 451
» Improving Random Forests
Sort
View
ECCC
2000
93views more  ECCC 2000»
13 years 7 months ago
Improved Approximation of MAX-CUT on Graphs of Bounded Degree
We analyze the addition of a simple local improvement step to various known randomized approximation algorithms. Let ' 0:87856 denote the best approximation ratio currently k...
Uriel Feige, Marek Karpinski, Michael Langberg
LSSC
2001
Springer
14 years 14 days ago
A Quasi-Monte Carlo Method for Integration with Improved Convergence
Abstract. Quasi-Monte Carlo methods are based on the idea that random Monte Carlo techniques can often be improved by replacing the underlying source of random numbers with a more ...
Aneta Karaivanova, Ivan Dimov, Sofiya Ivanovska
JCP
2008
121views more  JCP 2008»
13 years 8 months ago
Relation Organization of SOM Initial Map by Improved Node Exchange
The Self Organizing Map (SOM) involves neural networks, that learns the features of input data thorough unsupervised, competitive neighborhood learning. In the SOM learning algorit...
Tsutomu Miyoshi
AIED
2009
Springer
14 years 2 months ago
Adapting to Student Uncertainty Improves Tutoring Dialogues
This study shows that affect-adaptive computer tutoring can significantly improve performance on learning efficiency and user satisfaction. We compare two different student uncer...
Katherine Forbes-Riley, Diane J. Litman
IPPS
2007
IEEE
14 years 2 months ago
Automatic Program Segment Similarity Detection in Targeted Program Performance Improvement
Targeted optimization of program segments can provide an additional program speedup over the highest default optimization level, such as -O3 in GCC. The key challenge is how to au...
Haiping Wu, Eunjung Park, Mihailo Kaplarevic, Ying...