1060 search results - page 48 / 212 » On the Discovery of Random Trees |
ALGORITHMICA
2010
14 years 10 months ago
2010
We study the merging process when Kruskal's algorithm is run with random graphs as inputs. Our aim is to analyze this process when the underlying graph is the complete graph ...
TKDE
2008
14 years 10 months ago
2008
We study a new data mining problem concerning the discovery of frequent agreement subtrees (FASTs) from a set of phylogenetic trees. A phylogenetic tree, or phylogeny, is an unorde...
DIS
2007
Springer
14 years 11 months ago
2007
Springer
In this paper, we propose a new concept, thinning-out, for reducing the number of trials in skill discovery. Thinning-out means to skip over such trials that are unlikely to improv...
RSA
2010
14 years 8 months ago
2010
We analyze the convergence of the spectrum of large random graphs to the spectrum of a limit infinite graph. We apply these results to graphs converging locally to trees and deri...
PKDD
2000
Springer
15 years 1 months ago
2000
Springer
Abstract. This paper presents a lattice-based visual metaphor for knowledge discovery in electronic mail. It allow a user to navigate email using a visual lattice metaphor rather t...