Sciweavers

2593 search results - page 64 / 519
» Algorithms and Data Structures for Computer Topology
Sort
View
ICPP
2009
IEEE
15 years 5 days ago
A Parallel Algorithm for Computing Betweenness Centrality
In this paper we present a multi-grained parallel algorithm for computing betweenness centrality, which is extensively used in large-scale network analysis. Our method is based on ...
Guangming Tan, Dengbiao Tu, Ninghui Sun
158
Voted
CGF
2011
14 years 6 months ago
Global Structure Optimization of Quadrilateral Meshes
We introduce a fully automatic algorithm which optimizes the high-level structure of a given quadrilateral mesh to achieve a coarser quadrangular base complex. Such a topological ...
David Bommes, Timm Lempfer, Leif Kobbelt
ICIP
1999
IEEE
16 years 4 months ago
Quadtrees for Embedded Surface Visualization: Constraints and Efficient Data Structures
The quadtree data structure is widely used in digital image processing and computer graphics for modeling spatial segmentation of images and surfaces. A quadtree is a tree in whic...
Laurent Balmelli, Jelena Kovacevic, Martin Vetterl...
OOPSLA
2005
Springer
15 years 8 months ago
Lifting sequential graph algorithms for distributed-memory parallel computation
This paper describes the process used to extend the Boost Graph Library (BGL) for parallel operation with distributed memory. The BGL consists of a rich set of generic graph algor...
Douglas Gregor, Andrew Lumsdaine
ISMB
1997
15 years 3 months ago
Hierarchical Protein Structure Superposition Using Both Secondary Structure and Atomic Representations
The structural comparison of proteins has become increasingly important as a means to identify protein motifs and fold families. In this paper we present a new algorithm for the c...
Amit Pal Singh, Douglas L. Brutlag