Sciweavers

777 search results - page 6 / 156
» The Refined Process Structure Tree
Sort
View
71
Voted
ICIP
1999
IEEE
15 years 1 months ago
On the Use of Context Tree for Binary Image Compression
We consider the use of a static context tree for binary image compression. The contexts are stored in the leaves of a variable-depth binary tree. The tree structure itself is full...
Pasi Fränti, Eugene I. Ageenko
BMCBI
2006
95views more  BMCBI 2006»
14 years 9 months ago
A quantitative analysis of secondary RNA structure using domination based parameters on trees
Background: It has become increasingly apparent that a comprehensive database of RNA motifs is essential in order to achieve new goals in genomic and proteomic research. Secondary...
Teresa W. Haynes, Debra J. Knisley, Edith Seier, Y...
ICDCS
1996
IEEE
15 years 1 months ago
Group Routing without Group Routing Tables
We present a group routing protocol for a network of processes. The task of the protocol is to route data messages to each member of a process group. To this end, a tree of proces...
Jorge Arturo Cobb, Mohamed G. Gouda
79
Voted
WEBDB
2004
Springer
154views Database» more  WEBDB 2004»
15 years 2 months ago
Twig Query Processing over Graph-Structured XML Data
XML and semi-structured data is usually modeled using graph structures. Structural summaries, which have been proposed to speedup XML query processing have graph forms as well. Th...
Zografoula Vagena, Mirella Moura Moro, Vassilis J....
JMLR
2002
102views more  JMLR 2002»
14 years 9 months ago
Efficient Algorithms for Decision Tree Cross-validation
Cross-validation is a useful and generally applicable technique often employed in machine learning, including decision tree induction. An important disadvantage of straightforward...
Hendrik Blockeel, Jan Struyf