Sciweavers

1594 search results - page 69 / 319
» Fast Prediction on a Tree
Sort
View
ECML
2007
Springer
14 years 2 months ago
Additive Groves of Regression Trees
We present a new regression algorithm called Additive Groves and show empirically that it is superior in performance to a number of other established regression methods. A single G...
Daria Sorokina, Rich Caruana, Mirek Riedewald
PAKDD
2007
ACM
203views Data Mining» more  PAKDD 2007»
14 years 2 months ago
Grammar Guided Genetic Programming for Flexible Neural Trees Optimization
Abstract. In our previous studies, Genetic Programming (GP), Probabilistic Incremental Program Evolution (PIPE) and Ant Programming (AP) have been used to optimal design of Flexibl...
Peng Wu, Yuehui Chen
CIBCB
2006
IEEE
14 years 2 months ago
Prediction of the Number of Helices for the Twilight Zone Proteins
– Protein structure prediction is one of the core research areas in bioinformatics. This paper addresses the protein secondary structure prediction problem for the twilight zone ...
Kanaka Durga Kedarisetti, Ke Chen, Aashima Kapoor,...
TASLP
2008
96views more  TASLP 2008»
13 years 8 months ago
Fast Tracing of Acoustic Beams and Paths Through Visibility Lookup
The beam tracing method can be used for the fast tracing of a large number of acoustic paths through a direct lookup of a special tree-like data structure (beam tree) that describe...
Fabio Antonacci, M. Foco, Augusto Sarti, Stefano T...
JPDC
2006
134views more  JPDC 2006»
13 years 8 months ago
Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
David A. Bader, Guojing Cong