95 search results - page 13 / 19 » Lines, Trees, and Branch Spaces |
DIAGRAMS
2004
Springer
14 years 26 days ago
2004
Springer
A composite cluster map displays a fuzzy categorisation of geographic areas. It combines information from several sources to provide a visualisation of the significance of cluster...
SSDBM
2007
IEEE
14 years 1 months ago
2007
IEEE
Space-partitioning trees, like the disk-based trie, quadtree, kd-tree and their variants, are a family of access methods that index multi-dimensional objects. In the case of index...
GD
1998
Springer
13 years 11 months ago
1998
Springer
We describe a new approach for cluster-based drawing of very large graphs, which obtains clusters by using binary space partition (BSP) trees. We also introduce a novel BSP-type de...
GLVLSI
2003
IEEE
14 years 23 days ago
2003
IEEE
Octagonal Steiner Minimal Trees (OSMTs) are used in the global routing phase of pervasive octagonal VLSI layout. The OSMT problem seeks a minimal length spanning structure using e...
PLILP
1993
Springer
13 years 11 months ago
1993
Springer
Abstract. Solving equations in equational theories is a relevant programming paradigm which integrates logic and equational programming into one unified framework. Efficient metho...