4137 search results - page 70 / 828 » On the number of matchings of a tree |
100
click to vote
ALGORITHMICA
2005
15 years 1 months ago
2005
This paper focuses on space efficient representations of rooted trees that permit basic navigation in constant time. While most of the previous work has focused on binary trees, w...
123
click to vote
PPSN
2004
Springer
15 years 7 months ago
2004
Springer
We show how the understandability and speed of genetic programming classification algorithms can be improved, without affecting the classification accuracy. By analyzing the dec...
116
click to vote
EJC
2010
15 years 2 months ago
2010
We consider the number of nodes in the levels of unlabelled rooted random trees and show that the stochastic process given by the properly scaled level sizes weakly converges to th...
136
click to vote
ML
2006
ACM
15 years 1 months ago
2006
ACM
We present an approach to email filtering based on the suffix tree data structure. A method for the scoring of emails using the suffix tree is developed and a number of scoring and...
124
click to vote
SODA
2008
ACM
15 years 3 months ago
2008
ACM
Sleator and Tarjan [39] conjectured that splay trees are dynamically optimal binary search trees (BST). In this context, we study the skip list data structure introduced by Pugh [...