Sciweavers

736 search results - page 74 / 148
» Approximating the Number of Network Motifs
Sort
View
MLDM
2008
Springer
14 years 10 months ago
Distributed Monitoring of Frequent Items
Monitoring frequently occuring items is a recurring task in a variety of applications. Although a number of solutions have been proposed there has been few to address the problem i...
Robert Fuller, Mehmed M. Kantardzic
JAIR
2010
130views more  JAIR 2010»
14 years 8 months ago
Join-Graph Propagation Algorithms
The paper investigates parameterized approximate message-passing schemes that are based on bounded inference and are inspired by Pearl’s belief propagation algorithm (BP). We st...
Robert Mateescu, Kalev Kask, Vibhav Gogate, Rina D...
BMCBI
2006
116views more  BMCBI 2006»
14 years 10 months ago
Gene annotation and network inference by phylogenetic profiling
Background: Phylogenetic analysis is emerging as one of the most informative computational methods for the annotation of genes and identification of evolutionary modules of functi...
Jie Wu, Zhenjun Hu, Charles DeLisi
PODS
2009
ACM
119views Database» more  PODS 2009»
15 years 10 months ago
Exceeding expectations and clustering uncertain data
Database technology is playing an increasingly important role in understanding and solving large-scale and complex scientific and societal problems and phenomena, for instance, un...
Sudipto Guha, Kamesh Munagala
IMC
2007
ACM
14 years 11 months ago
Learning network structure from passive measurements
The ability to discover network organization, whether in the form of explicit topology reconstruction or as embeddings that approximate topological distance, is a valuable tool. T...
Brian Eriksson, Paul Barford, Robert Nowak, Mark C...