Sciweavers

750 search results - page 6 / 150
» Reconstruction for Models on Random Graphs
Sort
View
137
Voted
BMCBI
2007
160views more  BMCBI 2007»
15 years 1 months ago
Identifying protein complexes directly from high-throughput TAP data with Markov random fields
Background: Predicting protein complexes from experimental data remains a challenge due to limited resolution and stochastic errors of high-throughput methods. Current algorithms ...
Wasinee Rungsarityotin, Roland Krause, Arno Sch&ou...
107
Voted
SDM
2010
SIAM
115views Data Mining» more  SDM 2010»
15 years 3 months ago
Reconstructing Randomized Social Networks
In social networks, nodes correspond to entities and edges to links between them. In most of the cases, nodes are also associated with a set of features. Noise, missing values or ...
Niko Vuokko, Evimaria Terzi
CORR
2011
Springer
205views Education» more  CORR 2011»
14 years 8 months ago
Random Walk on Directed Dynamic Graphs
Dynamic graphs have emerged as an appropriate model to capture the changing nature of many modern networks, such as peer-to-peer overlays and mobile ad hoc networks. Most of the re...
Oksana Denysyuk, Luis Rodrigues
JCB
2006
124views more  JCB 2006»
15 years 1 months ago
The Distribution of Genomic Distance between Random Genomes
We study the probability distribution of genomic distance d under the hypothesis of random gene order. We translate the random order assumption into a stochastic method for constr...
David Sankoff, Lani Haque
WWW
2007
ACM
16 years 2 months ago
Random web crawls
This paper proposes a random Web crawl model. A Web crawl is a (biased and partial) image of the Web. This paper deals with the hyperlink structure, i.e. a Web crawl is a graph, w...
Toufik Bennouas, Fabien de Montgolfier