Sciweavers

785 search results - page 51 / 157
» Binary Join Trees
Sort
View
IPL
2002
90views more  IPL 2002»
14 years 9 months ago
On the approximability of two tree drawing conventions
We consider two aesthetic criteria for the visualization of rooted trees: inclusion and tip-over. Finding the minimum area layout according to either of these two standards is an ...
Paolo Penna
ICPP
1994
IEEE
15 years 2 months ago
Computational Properties of Mesh Connected Trees: Versatile Architectures for Parallel Computation
Recently, the mesh connected trees (MCT) network has been proposed as a possible architecture for parallel computers. MCT networks are obtained by combining complete binary trees ...
Kemal Efe, Antonio Fernández
CCR
1998
140views more  CCR 1998»
14 years 9 months ago
Policy tree multicast routing: an extension to sparse mode source tree delivery
Bandwidth-sensitive multicast delivery controlled by routing criteria pertinent to the actual traffic flow is very costly in terms of router state and control overhead and it scal...
Horst Hodel
BMCBI
2004
87views more  BMCBI 2004»
14 years 9 months ago
Selection of informative clusters from hierarchical cluster tree with gene classes
Background: A common clustering method in the analysis of gene expression data has been hierarchical clustering. Usually the analysis involves selection of clusters by cutting the...
Petri Törönen
59
Voted
ESOP
2004
Springer
15 years 3 months ago
Adaptive Pattern Matching on Binary Data
Pattern matching is an important operation in functional programs. So far, pattern matching has been investigated in the context of structured terms. This paper presents an approac...
Per Gustafsson, Konstantinos F. Sagonas