Sciweavers

187 search results - page 9 / 38
» Labeling Schemes for Tree Representation
Sort
View
EDBTW
2004
Springer
14 years 1 months ago
L-Tree: A Dynamic Labeling Structure for Ordered XML Data
With the ever growing use of XML as a data representation format, we see an increasing need for robust, high performance XML database systems. While most of the recent work focuses...
Yi Chen, George A. Mihaila, Rajesh Bordawekar, Sri...
ICALP
2007
Springer
14 years 2 months ago
Succinct Ordinal Trees Based on Tree Covering
Abstract. Various methods have been used to represent a tree on n nodes in essentially the informationtheoretic minimum space while supporting various navigational operations in co...
Meng He, J. Ian Munro, S. Srinivasa Rao
DMKD
1999
ACM
108views Data Mining» more  DMKD 1999»
14 years 5 days ago
Classification as Mining and Use of Labeled Itemsets
We investigate the relationship between association and classification mining. The main issue in association mining is the discovery of interesting patterns of the data, so called...
Dimitris Meretakis, Beat Wüthrich
IWCIA
2004
Springer
14 years 1 months ago
Integral Trees: Subtree Depth and Diameter
Regions in an image graph can be described by their spanning tree. A graph pyramid is a stack of image graphs at different granularities. Integral features capture important prope...
Walter G. Kropatsch, Yll Haxhimusa, Zygmunt Pizlo
CORR
2008
Springer
112views Education» more  CORR 2008»
13 years 8 months ago
Compact Labelings For Efficient First-Order Model-Checking
We consider graph properties that can be checked from labels, i.e., bit sequences, of logarithmic length attached to vertices. We prove that there exists such a labeling for check...
Bruno Courcelle, Cyril Gavoille, Mamadou Moustapha...