187 search results - page 14 / 38 » Labeling Schemes for Tree Representation |
ICDM
2002
IEEE
14 years 24 days ago
2002
IEEE
In this paper, we propose a new framework for mining frequent patterns from large transactional databases. The core of the framework is of a novel coded prefix-path tree with two...
ICASSP
2010
IEEE
13 years 8 months ago
2010
IEEE
In this paper we reveal a connection between the coefficients of the morphological wavelet transform and complexity measures of dyadic tree representations of level sets. This le...
VRST
1997
ACM
14 years 1 days ago
1997
ACM
This paper describes a new algorithm for view volume culling. During an interactive walkthrough of a 3D scene, at any moment a large proportion of objects will be outside of the v...
DCC
2005
IEEE
14 years 7 months ago
2005
IEEE
ct A very fast, low complexity algorithm for resolution scalable and random access decoding is presented. The algorithm is based on AGP (Alphabet and Group Partitioning) [1], where...
EMNLP
2009
13 years 5 months ago
2009
We present a framework to extract the most important features (tree fragments) from a Tree Kernel (TK) space according to their importance in the target kernelbased machine, e.g. ...