Sciweavers

712 search results - page 78 / 143
» A mixture model for random graphs
Sort
View
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...
ECML
2004
Springer
15 years 6 months ago
The Principal Components Analysis of a Graph, and Its Relationships to Spectral Clustering
This work presents a novel procedure for computing (1) distances between nodes of a weighted, undirected, graph, called the Euclidean Commute Time Distance (ECTD), and (2) a subspa...
Marco Saerens, François Fouss, Luh Yen, Pie...
SODA
2007
ACM
127views Algorithms» more  SODA 2007»
15 years 2 months ago
Line-of-sight networks
Random geometric graphs have been one of the fundamental models for reasoning about wireless networks: one places n points at random in a region of the plane (typically a square o...
Alan M. Frieze, Jon M. Kleinberg, R. Ravi, Warren ...
ICML
2010
IEEE
15 years 2 months ago
Learning Temporal Causal Graphs for Relational Time-Series Analysis
Learning temporal causal graph structures from multivariate time-series data reveals important dependency relationships between current observations and histories, and provides a ...
Yan Liu 0002, Alexandru Niculescu-Mizil, Aurelie C...
IDA
2009
Springer
15 years 6 months ago
Image Source Separation Using Color Channel Dependencies
We investigate the problem of source separation in images in the Bayesian framework using the color channel dependencies. As a case in point we consider the source separation of co...
Koray Kayabol, Ercan E. Kuruoglu, Bülent Sank...