Sciweavers

484 search results - page 21 / 97
» Large graph processing in the cloud
Sort
View
CPC
2007
76views more  CPC 2007»
14 years 9 months ago
A Point Process Describing the Component Sizes in the Critical Window of the Random Graph Evolution
We study a point process describing the asymptotic behavior of sizes of the largest components of the random graph G(n, p) in the critical window, that is, for p = n−1 + λn−4/...
Svante Janson, Joel Spencer
3DIM
2003
IEEE
15 years 2 months ago
A Discrete Reeb Graph Approach for the Segmentation of Human Body Scans
Segmentation of 3D human body (HB) scan is a very challenging problem in applications exploiting human scan data. To tackle this problem, this paper proposes a topological approac...
Yijun Xiao, Paul Siebert, Naoufel Werghi
CIB
2005
125views more  CIB 2005»
14 years 9 months ago
An On-Line Web Visualization System with Filtering and Clustering Graph
A Web graph refers to the graph that is used to represent relationships between Web pages in cyberspace, where a node represents a URL and an edge indicates a link between two URLs...
Wei Lai, Xiaodi Huang, Ronald Wibowo, Jiro Tanaka
APVIS
2009
14 years 10 months ago
TugGraph: Path-preserving hierarchies for browsing proximity and paths in graphs
Many graph visualization systems use graph hierarchies to organize a large input graph into logical components. These approaches detect features globally in the data and place the...
Daniel Archambault, Tamara Munzner, David Auber
68
Voted
TVCG
2011
100views more  TVCG 2011»
14 years 4 months ago
Tugging Graphs Faster: Efficiently Modifying Path-Preserving Hierarchies for Browsing Paths
—Many graph visualization systems use graph hierarchies to organize a large input graph into logical components. These approaches detect features globally in the data and place t...
Daniel Archambault, Tamara Munzner, David Auber