Sciweavers

79 search results - page 4 / 16
» The pq-gram distance between ordered labeled trees
Sort
View
COMBINATORICS
2004
84views more  COMBINATORICS 2004»
13 years 7 months ago
Planar Maps as Labeled Mobiles
We extend Schaeffer's bijection between rooted quadrangulations and welllabeled trees to the general case of Eulerian planar maps with prescribed face valences to obtain a bi...
J. Bouttier, P. Di Francesco, E. Guitter
IJCV
2007
115views more  IJCV 2007»
13 years 7 months ago
Discovering Shape Classes using Tree Edit-Distance and Pairwise Clustering
This paper describes work aimed at the unsupervised learning of shape-classes from shock trees. We commence by considering how to compute the edit distance between weighted trees. ...
Andrea Torsello, Antonio Robles-Kelly, Edwin R. Ha...
IS
2006
13 years 7 months ago
A methodology for clustering XML documents by structure
The processing and management of XML data are popular research issues. However, operations based on the structure of XML data have not received strong attention. These operations ...
Theodore Dalamagas, Tao Cheng, Klaas-Jan Winkel, T...
SETN
2004
Springer
14 years 29 days ago
Clustering XML Documents by Structure
This work explores the application of clustering methods for grouping structurally similar XML documents. Modeling the XML documents as rooted ordered labeled trees, we apply clust...
Theodore Dalamagas, Tao Cheng, Klaas-Jan Winkel, T...
DM
2008
104views more  DM 2008»
13 years 7 months ago
On edge-weighted recursive trees and inversions in random permutations
We introduce random recursive trees, where deterministically weights are attached to the edges according to the labeling of the trees. We will give a bijection between recursive t...
Markus Kuba, Alois Panholzer