Sciweavers

2304 search results - page 133 / 461
» On the Vulnerability of Large Graphs
Sort
View
AINA
2004
IEEE
15 years 10 months ago
Parallel PageRank Computation on a Gigabit PC Cluster
Efficient computing the PageRank scores for a large web graph is actually one of the hot issues in Web-IR community. Recent researches propose to accelerate the computation, both ...
Bundit Manaskasemsak, Arnon Rungsawang
TVCG
2008
145views more  TVCG 2008»
15 years 6 months ago
Geometry-Based Edge Clustering for Graph Visualization
Graphs have been widely used to model relationships among data. For large graphs, excessive edge crossings make the display visually cluttered and thus difficult to explore. In thi...
Weiwei Cui, Hong Zhou, Huamin Qu, Pak Chung Wong, ...
COMPLEX
2009
Springer
15 years 10 months ago
Capturing Internet Traffic Dynamics through Graph Distances
Studies of the Internet have typically focused either on the routing system, i.e. the paths chosen to reach a given destination, or on the evolution of traffic on a physical link. ...
Steve Uhlig, Bingjie Fu, Almerima Jamakovic
DAC
2009
ACM
15 years 10 months ago
Reduction techniques for synchronous dataflow graphs
The Synchronous Dataflow (SDF) model of computation is popular for modelling the timing behaviour of real-time embedded hardware and software systems and applications. It is an es...
Marc Geilen
WABI
2009
Springer
162views Bioinformatics» more  WABI 2009»
16 years 23 days ago
Aligning Biomolecular Networks Using Modular Graph Kernels
Comparative analysis of biomolecular networks constructed using measurements from different conditions, tissues, and organisms offer a powerful approach to understanding the stru...
Fadi Towfic, M. Heather West Greenlee, Vasant Hona...