Sciweavers

2834 search results - page 44 / 567
» Representing Trees with Constraints
Sort
View
ICIP
2001
IEEE
14 years 10 months ago
Color image coding, indexing and retrieval using binary space partitioning tree
This paper presents a unified approach to colour image coding, content-based indexing, and retrieval for database applications. The binary space partitioning (BSP) tree, tradition...
Guoping Qiu, S. Sudirman
WWW
2006
ACM
14 years 9 months ago
Online mining of frequent query trees over XML data streams
In this paper, we proposed an online algorithm, called FQT-Stream (Frequent Query Trees of Streams), to mine the set of all frequent tree patterns over a continuous XML data strea...
Hua-Fu Li, Man-Kwan Shan, Suh-Yin Lee
CIKM
2009
Springer
14 years 1 months ago
Minimal common container of tree patterns
Tree patterns represent important fragments of XPath. In this paper, we show that some classes of tree patterns exhibit such a property that, given a finite number of tree patter...
Junhu Wang, Jeffrey Xu Yu, Chaoyi Pang, Chengfei L...
COCOON
2006
Springer
14 years 18 days ago
Reconciling Gene Trees with Apparent Polytomies
We consider the problem of reconciling gene trees with a species tree based on the widely accepted Gene Duplication model from Goodman et al. Current algorithms that solve this pro...
Wen-Chieh Chang 0002, Oliver Eulenstein
DCC
1998
IEEE
14 years 1 months ago
The Context Trees of Block Sorting Compression
Abstract. The Burrows-Wheeler transform (BWT) and block sorting compression are closely related to the context trees of PPM. The usual approach of treating BWT as merely a permutat...
N. Jesper Larsson