Sciweavers

514 search results - page 51 / 103
» Drawing a Graph in a Hypercube
Sort
View
IJPP
2011
99views more  IJPP 2011»
14 years 4 months ago
Regular Lattice and Small-World Spin Model Simulations Using CUDA and GPUs
Data-parallel accelerator devices such as Graphical Processing Units (GPUs) are providing dramatic performance improvements over even multicore CPUs for lattice-oriented applicatio...
Kenneth A. Hawick, Arno Leist, Daniel P. Playne
KES
2008
Springer
14 years 9 months ago
Visual Analysis Tool for Bipartite Networks
Abstract. To find hidden features of co-authoring relationships, we focused on drawing techniques for bipartite graphs. We previously developed a drawing method called "anchor...
Kazuo Misue
GD
2005
Springer
15 years 3 months ago
A Mixed-Integer Program for Drawing High-Quality Metro Maps
In this paper we investigate the problem of drawing metro maps which is defined as follows. Given a planar graph G of maximum degree 8 with its embedding and vertex locations (e.g...
Martin Nöllenburg, Alexander Wolff
PAMI
2002
184views more  PAMI 2002»
14 years 9 months ago
Identifying Faces in a 2D Line Drawing Representing a Manifold Object
A straightforward way to illustrate a 3D model is to use a line drawing. Faces in a 2D line drawing provide important information for reconstructing its 3D geometry. Manifold objec...
Jianzhuang Liu, Yong Tsui Lee, Wai-kuen Cham
88
Voted
PC
2000
96views Management» more  PC 2000»
14 years 9 months ago
Multicast communication in wormhole-routed star graph interconnection networks
Multicast, an important communication mechanism, is frequently applied in parallel computing. The star graph interconnection network, when compared with the hypercube network, bei...
Tzung-Shi Chen, Neng-Chung Wang, Chih-Ping Chu