Sciweavers

2680 search results - page 135 / 536
» The topology of the independence complex
Sort
View
PODC
2011
ACM
14 years 4 months ago
MIS on trees
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
Christoph Lenzen, Roger Wattenhofer
ECCV
2000
Springer
16 years 3 months ago
Divergence-Based Medial Surfaces
The medial surface of a volumetric object is of significant interest for shape analysis. However, its numerical computation can be subtle. Methods based on Voronoi techniques prese...
Sylvain Bouix, Kaleem Siddiqi
MICCAI
2004
Springer
16 years 2 months ago
A Data Clustering and Streamline Reduction Method for 3D MR Flow Vector Field Simplification
Abstract. With the increasing capability of MR imaging and Computational Fluid Dynamics (CFD) techniques, a significant amount of data related to the haemodynamics of the cardiovas...
Bernardo Silva Carmo, Yin-Heung Pauline Ng, Adam P...
VISUALIZATION
1997
IEEE
15 years 5 months ago
The VSBUFFER: visibility ordering of unstructured volume primitives by polygon drawing
Different techniques have been proposed for rendering volumetric scalar data sets. Usually these approaches are focusing on orthogonal cartesian grids, but in the last years resea...
Rüdiger Westermann, Thomas Ertl
ALENEX
2003
137views Algorithms» more  ALENEX 2003»
15 years 2 months ago
The Markov Chain Simulation Method for Generating Connected Power Law Random Graphs
Graph models for real-world complex networks such as the Internet, the WWW and biological networks are necessary for analytic and simulation-based studies of network protocols, al...
Christos Gkantsidis, Milena Mihail, Ellen W. Zegur...