Sciweavers

507 search results - page 62 / 102
» Generating Better Decision Trees
Sort
View
UAI
2004
13 years 11 months ago
A Complete Anytime Algorithm for Treewidth
In this paper, we present a Branch and Bound algorithm called QuickBB for computing the treewidth of an undirected graph. This algorithm performs a search in the space of perfect ...
Vibhav Gogate, Rina Dechter
ICPR
2008
IEEE
14 years 11 months ago
Application of triphone clustering in acoustic modeling for continuous speech recognition in Bengali
The performance of the acoustic models is highly reflective on the overall performance of any continuous speech recognition system. Hence generation of an accurate and robust acou...
Anupam Basu, Gaurav Garg, Pabitra Mitra, Pratyush ...
ICSE
2004
IEEE-ACM
14 years 10 months ago
Finding Latent Code Errors via Machine Learning over Program Executions
This paper proposes a technique for identifying program properties that indicate errors. The technique generates machine learning models of program properties known to result from...
Yuriy Brun, Michael D. Ernst
EUROPAR
2007
Springer
14 years 4 months ago
Compositional Approach Applied to Loop Specialization
An optimizing compiler has a hard time to generate a code which will perform at top speed for an arbitrary data set size. In general, the low level optimization process must take i...
Lamia Djoudi, Jean-Thomas Acquaviva, Denis Barthou
LICS
2009
IEEE
14 years 4 months ago
Functional Reachability
—What is reachability in higher-order functional programs? We formulate reachability as a decision problem in the setting of the prototypical functional language PCF, and show th...
C.-H. Luke Ong, Nikos Tzevelekos