Sciweavers

712 search results - page 72 / 143
» A mixture model for random graphs
Sort
View
CORR
2007
Springer
110views Education» more  CORR 2007»
13 years 9 months ago
Graph Annotations in Modeling Complex Network Topologies
abstract such additional information as network annotations. We introduce a network topology modeling framework that treats annotations as an extended correlation profile of a net...
Xenofontas A. Dimitropoulos, Dmitri V. Krioukov, A...
ICA
2004
Springer
14 years 2 months ago
Postnonlinear Overcomplete Blind Source Separation Using Sparse Sources
Abstract. We present an approach for blindly decomposing an observed random vector x into f(As) where f is a diagonal function i.e. f = f1 × . . . × fm with one-dimensional funct...
Fabian J. Theis, Shun-ichi Amari
RECOMB
2007
Springer
14 years 9 months ago
Association Mapping of Complex Diseases with Ancestral Recombination Graphs: Models and Efficient Algorithms
Association, or LD (linkage disequilibrium), mapping is an intensely-studied approach to gene mapping (genome-wide or in candidate regions) that is widely hoped to be able to effic...
Yufeng Wu
MICCAI
2008
Springer
14 years 10 months ago
A Discriminative Model-Constrained Graph Cuts Approach to Fully Automated Pediatric Brain Tumor Segmentation in 3-D MRI
In this paper we present a fully automated approach to the segmentation of pediatric brain tumors in multi-spectral 3-D magnetic resonance images. It is a top-down segmentation app...
Michael Wels, Gustavo Carneiro, Alexander Aplas,...
ACMSE
2005
ACM
14 years 2 months ago
Bibliometric approach to community discovery
Recent research suggests that most of the real-world random networks organize themselves into communities. Communities are formed by subsets of nodes in a graph, which are closely...
Narsingh Deo, Hemant Balakrishnan