Sciweavers

2304 search results - page 458 / 461
» On the Vulnerability of Large Graphs
Sort
View
BMCBI
2010
223views more  BMCBI 2010»
13 years 2 months ago
MetNetGE: interactive views of biological networks and ontologies
Background: Linking high-throughput experimental data with biological networks is a key step for understanding complex biological systems. Currently, visualization tools for large...
Ming Jia, Suh-Yeon Choi, Dirk Reiners, Eve Syrkin ...
GC
2011
Springer
13 years 2 months ago
Properly Edge-Coloured Subgraphs in Colourings of Bounded Degree
The smallest n such that every colouring of the edges of Kn must contain a monochromatic star K1,s+1 or a properly edge-coloured Kt is denoted by f(s, t). Its existence is guarant...
Klas Markström, Andrew Thomason, Peter Wagner...
CORR
2010
Springer
236views Education» more  CORR 2010»
13 years 2 months ago
Precise, Scalable and Online Request Tracing for Multi-tier Services of Black Boxes
As more and more multi-tier services are developed from commercial off-the-shelf components or heterogeneous middleware without source code available, both developers and administr...
Bo Sang, Jianfeng Zhan, Zhihong Zhang, Lei Wang, D...
PVLDB
2010
220views more  PVLDB 2010»
13 years 2 months ago
Fast Incremental and Personalized PageRank
In this paper, we analyze the efficiency of Monte Carlo methods for incremental computation of PageRank, personalized PageRank, and similar random walk based methods (with focus o...
Bahman Bahmani, Abdur Chowdhury, Ashish Goel
SIAMSC
2010
142views more  SIAMSC 2010»
13 years 2 months ago
Hypergraph-Based Unsymmetric Nested Dissection Ordering for Sparse LU Factorization
In this paper we present HUND, a hypergraph-based unsymmetric nested dissection ordering algorithm for reducing the fill-in incurred during Gaussian elimination. HUND has several i...
Laura Grigori, Erik G. Boman, Simplice Donfack, Ti...