Sciweavers

4137 search results - page 147 / 828
» On the number of matchings of a tree
Sort
View
ICASSP
2011
IEEE
14 years 10 months ago
Pronunciation variation modeling of non-native proper names by discriminative tree search
In this paper, the task of selecting the optimal subset of pronunciation variants from a set of automatically generated candidates is recast as a tree search problem. In this appr...
Line Adde, Torbjørn Svendsen
RSA
2011
106views more  RSA 2011»
14 years 9 months ago
Distances between pairs of vertices and vertical profile in conditioned Galton-Watson trees
We consider a conditioned Galton–Watson tree and prove an estimate of the number of pairs of vertices with a given distance, or, equivalently, the number of paths of a given leng...
Luc Devroye, Svante Janson
ICML
1999
IEEE
16 years 7 months ago
The Alternating Decision Tree Learning Algorithm
The applicationofboosting procedures to decision tree algorithmshas been shown to produce very accurate classi ers. These classiers are in the form of a majority vote over a numbe...
Yoav Freund, Llew Mason
KDD
2003
ACM
150views Data Mining» more  KDD 2003»
16 years 7 months ago
Learning relational probability trees
Classification trees are widely used in the machine learning and data mining communities for modeling propositional data. Recent work has extended this basic paradigm to probabili...
Jennifer Neville, David Jensen, Lisa Friedland, Mi...
VLDB
2008
ACM
178views Database» more  VLDB 2008»
16 years 6 months ago
The Bdual-Tree: indexing moving objects by space filling curves in the dual space
Abstract Existing spatiotemporal indexes suffer from either large update cost or poor query performance, except for the Bx -tree (the state-of-the-art), which consists of multiple ...
Man Lung Yiu, Yufei Tao, Nikos Mamoulis