462 search results - page 21 / 93 » Covering a Tree by a Forest |
ACMSE
2008
ACM
13 years 9 months ago
2008
ACM
In this paper, a new pattern-growth algorithm is presented to mine frequent sequential patterns using First-Occurrence Forests (FOF). This algorithm uses a simple list of pointers...
ACL
2008
13 years 8 months ago
2008
Among syntax-based translation models, the tree-based approach, which takes as input a parse tree of the source sentence, is a promising direction being faster and simpler than it...
EJC
2010
13 years 7 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...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
The problem of learning forest-structured discrete graphical models from i.i.d. samples is considered. An algorithm based on pruning of the Chow-Liu tree through adaptive threshol...
IPPS
1998
IEEE
13 years 11 months ago
1998
IEEE
We present a rst randomized Ologk n time and On+m work CRCWPRAM algorithm for nding a spanning forest of an undirected dense graph with n vertices. Furthermore we construct a rando...