Sciweavers

5606 search results - page 157 / 1122
» Randomization Techniques for Graphs.
Sort
View
BIOINFORMATICS
2008
172views more  BIOINFORMATICS 2008»
13 years 11 months ago
Fitting a geometric graph to a protein-protein interaction network
Motivation: Finding a good network null model for protein-protein interaction (PPI) networks is a fundamental issue. Such a model would provide insights into the interplay between...
Desmond J. Higham, Marija Rasajski, Natasa Przulj
CHI
2010
ACM
14 years 5 months ago
Graphemes: self-organizing shape-based clustered structures for network visualisations
Network visualisations use clustering approaches to simplify the presentation of complex graph structures. We present a novel application of clustering algorithms, which controls ...
Ross Shannon, Aaron J. Quigley, Paddy Nixon
CSC
2006
14 years 6 days ago
Statistical Analysis of Linear Random Differential Equation
In this paper, a new method is proposed in order to evaluate the stochastic solution of linear random differential equation. The method is based on the combination of the probabili...
Seifedine Kadry
CORR
2007
Springer
136views Education» more  CORR 2007»
13 years 10 months ago
The analytic computability of the Shannon transform for a large class of random matrix channels
We define a class of “algebraic” random matrix channels for which one can generically compute the limiting Shannon transform using numerical techniques and often enumerate th...
N. Raj Rao
CVPR
2009
IEEE
15 years 6 months ago
P-Brush: Continuous Valued MRFs with Normed Pairwise Distributions for Image Segmentation
Interactive image segmentation traditionally involves the use of algorithms such as Graph Cuts or Random Walker. Common concerns with using Graph Cuts are metrication artifacts ...
Dheeraj Singaraju, Leo Grady, René Vidal