Sciweavers

785 search results - page 16 / 157
» Binary Join Trees
Sort
View
ICPP
1993
IEEE
15 years 1 months ago
Parallel Computation of the Singular Value Decomposition on Tree Architectures
We describe three new Jacobi orderings for parallel computation of SVD problems on tree architectures. The rst ordering uses the high bandwidth of a perfect binary fat-tree to min...
Bing Bing Zhou, Richard P. Brent
SIGMOD
2002
ACM
127views Database» more  SIGMOD 2002»
15 years 9 months ago
Approximate XML joins
XML is widely recognized as the data interchange standard for tomorrow, because of its ability to represent data from a wide variety of sources. Hence, XML is likely to be the for...
Sudipto Guha, H. V. Jagadish, Nick Koudas, Divesh ...
BICOB
2009
Springer
15 years 4 months ago
Generalized Binary Tanglegrams: Algorithms and Applications
Several applications require the joint display of two phylogenetic trees whose leaves are matched by inter-tree edges. This issue arises, for example, when comparing gene trees and...
Mukul S. Bansal, Wen-Chieh Chang 0002, Oliver Eule...
IEICET
2006
80views more  IEICET 2006»
14 years 9 months ago
On Reconfiguring Radial Trees
A linkage is a collection of line segments, called bars, possibly joined at their ends, called joints. Straightening a tree linkage is a continuous motion of their bars from an ini...
Yoshiyuki Kusakari
ADBIS
1995
Springer
112views Database» more  ADBIS 1995»
15 years 1 months ago
Spatial Joins and R-trees
One of the most important operations in spatial access needed systems are spatial joins. Using for processing such operations R-tree like structures is intensively studies now. Th...
M. G. Martynov