Sciweavers

598 search results - page 59 / 120
» A random graph model for massive graphs
Sort
View
SODA
2004
ACM
144views Algorithms» more  SODA 2004»
15 years 1 months ago
Covering minimum spanning trees of random subgraphs
We consider the problem of finding a sparse set of edges containing the minimum spanning tree (MST) of a random subgraph of G with high probability. The two random models that we ...
Michel X. Goemans, Jan Vondrák
INFOCOM
2009
IEEE
15 years 6 months ago
Prize-Collecting Data Fusion for Cost-Performance Tradeoff in Distributed Inference
—A novel formulation for optimal sensor selection and in-network fusion for distributed inference known as the prizecollecting data fusion (PCDF) is proposed in terms of optimal ...
Animashree Anandkumar, Meng Wang, Lang Tong, Anant...
BIBE
2006
IEEE
160views Bioinformatics» more  BIBE 2006»
15 years 6 months ago
Methods for Random Modularization of Biological Networks
— Biological networks are formalized summaries of our knowledge about interactions among biological system components, like genes, proteins, or metabolites. From their global top...
Zachary M. Saul, Vladimir Filkov
GBRPR
2005
Springer
15 years 5 months ago
Collaboration Between Statistical and Structural Approaches for Old Handwritten Characters Recognition
Abstract. In this article we try to make different kinds of information cooperate in a characters recognition system addressing old Greek and Egyptians documents. We first use a ...
Denis Arrivault, Noël Richard, Christine Fern...
BMCBI
2005
120views more  BMCBI 2005»
14 years 11 months ago
SpectralNET - an application for spectral graph analysis and visualization
Background: Graph theory provides a computational framework for modeling a variety of datasets including those emerging from genomics, proteomics, and chemical genetics. Networks ...
Joshua J. Forman, Paul A. Clemons, Stuart L. Schre...