7259 search results - page 73 / 1452 » From Fields to Trees |
ARSCOM
2007
13 years 8 months ago
2007
We partition the set of spanning trees contained in the complete graph Kn into spanning trees contained in the complete bipartite graph Ks,t. This relation will show that any prop...
RSA
1998
13 years 7 months ago
1998
A periodic tree Tn consists of full n-level copies of a finite tree T. The tree Tn is labeled by random bits. The root label is chosen randomly, and the probability of two adjace...
RP
2010
Springer
13 years 6 months ago
2010
Springer
Efficient reachability query answering in large directed graphs has been intensively investigated because of its fundamental importance in many application fields such as XML data ...
ALT
2003
Springer
13 years 11 months ago
2003
Springer
Due to the rapid growth of tree structured data such as Web documents, efficient learning from tree structured data becomes more and more important. In order to represent structura...
CHI
1993
ACM
14 years 7 days ago
1993
ACM
The object-oriented history mechanism of the GINA application framework and its relevance for multi-user applications are demonstrated. The interaction history of a document is re...