Sciweavers

522 search results - page 46 / 105
» A Graph Theoretical Approach to Network Encoding Complexity
Sort
View
IDA
2010
Springer
15 years 4 months ago
A Framework for Path-Oriented Network Simplification
Abstract. We propose a generic framework and methods for simplification of large networks. The methods can be used to improve the understandability of a given network, to complemen...
Hannu Toivonen, Sébastien Mahler, Fang Zhou
CSB
2002
IEEE
169views Bioinformatics» more  CSB 2002»
15 years 8 months ago
Bayesian Network and Nonparametric Heteroscedastic Regression for Nonlinear Modeling of Genetic Network
We propose a new statistical method for constructing a genetic network from microarray gene expression data by using a Bayesian network. An essential point of Bayesian network con...
Seiya Imoto, SunYong Kim, Takao Goto, Sachiyo Abur...
CVPR
2010
IEEE
15 years 11 months ago
Parallel and Distributed Graph Cuts by Dual Decomposition
Graph cuts methods are at the core of many state-of-theart algorithms in computer vision due to their efficiency in computing globally optimal solutions. In this paper, we solve t...
Petter Strandmark, Fredrik Kahl
GD
2007
Springer
15 years 9 months ago
Visualizing Internet Evolution on the Autonomous Systems Level
We propose a visualization approach for large dynamic graph structures with high degree variation and low diameter. In particular, we reduce visual complexity by multiple modes of ...
Krists Boitmanis, Ulrik Brandes, Christian Pich
EDBT
2006
ACM
174views Database» more  EDBT 2006»
16 years 3 months ago
Fast Computation of Reachability Labeling for Large Graphs
The need of processing graph reachability queries stems from many applications that manage complex data as graphs. The applications include transportation network, Internet traffic...
Jiefeng Cheng, Jeffrey Xu Yu, Xuemin Lin, Haixun W...