Sciweavers

4095 search results - page 28 / 819
» How to test a tree
Sort
View
PPOPP
2009
ACM
14 years 8 months ago
How much parallelism is there in irregular applications?
Irregular programs are programs organized around pointer-based data structures such as trees and graphs. Recent investigations by the Galois project have shown that many irregular...
Milind Kulkarni, Martin Burtscher, Rajeshkar Inkul...
DIS
2008
Springer
13 years 9 months ago
Ensemble-Trees: Leveraging Ensemble Power Inside Decision Trees
Decision trees are among the most effective and interpretable classification algorithms while ensembles techniques have been proven to alleviate problems regarding over-fitting and...
Albrecht Zimmermann
AMR
2007
Springer
197views Multimedia» more  AMR 2007»
14 years 1 months ago
How to Use SIFT Vectors to Analyze an Image with Database Templates
During last years, local image descriptors have received much attention because of their efficiency for several computer vision tasks such as image retrieval, image comparison, fea...
Adrien Auclair, Laurent D. Cohen, Nicole Vincent
CSB
2005
IEEE
130views Bioinformatics» more  CSB 2005»
14 years 1 months ago
TreeRefiner: A Tool for Refining a Multiple Alignment on a Phylogenetic Tree
We present TreeRefiner, a tool for refining multiple alignments of biological sequences. Given a multiple alignment, a phylogenetic tree, and scoring parameters as input, TreeRefi...
Aswath Manohar, Serafim Batzoglou
GPEM
2000
103views more  GPEM 2000»
13 years 7 months ago
Size Fair and Homologous Tree Crossovers for Tree Genetic Programming
Abstract. Size fair and homologous crossover genetic operators for tree based genetic programming are described and tested. Both produce considerably reduced increases in program s...
William B. Langdon