830 search results - page 123 / 166 » Route kernels for trees |
UAI
2000
15 years 1 months ago
2000
This paper is about the use of metric data structures in high-dimensionalor non-Euclidean space to permit cached sufficientstatisticsaccelerationsof learning algorithms. It has re...
103
click to vote
IJDMB
2007
14 years 11 months ago
2007
: Phylogenetic profiles of proteins strings of ones and zeros encoding respectively the presence and absence of proteins in a group of genomes have recently been used to id...
137
click to vote
ESANN
2006
15 years 1 months ago
2006
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 ...
103
click to vote
CIVR
2009
Springer
15 years 6 months ago
2009
Springer
Sequence matching techniques are effective for comparing two videos. However, existing approaches suffer from demanding computational costs and thus are not scalable for large-sca...
103
click to vote
EURODAC
1994
IEEE
15 years 4 months ago
1994
IEEE
In performance-driven interconnect design, delay estimators are used to determine both the topology and the layout of good routing trees. We address the class of moment-matching, ...