1542 search results - page 208 / 309 » The metamathematics of random graphs |
149
click to vote
ISAAC
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. The rendezvous problem in graphs has been extensively studied in the literature, mainly using a randomized approach. Two mobile agents have to meet at some node of a conn...
139
click to vote
DCC
2007
IEEE
16 years 6 months ago
2007
IEEE
We consider the distributed computation of a function of random sources with minimal communication. Specifically, given two discrete memoryless sources, X and Y , a receiver wishe...
181
click to vote
WDAG
2009
Springer
16 years 29 days ago
2009
Springer
Abstract. We adapt the compact routing scheme by Thorup and Zwick to optimize it for power-law graphs. We analyze our adapted routing scheme based on the theory of unweighted rando...
198
click to vote
BMCBI
2005
15 years 6 months ago
2005
Background: Graph theory provides a computational framework for modeling a variety of datasets including those emerging from genomics, proteomics, and chemical genetics. Networks ...
192
click to vote
ICML
2008
IEEE
16 years 7 months ago
2008
IEEE
Graph transduction methods label input data by learning a classification function that is regularized to exhibit smoothness along a graph over labeled and unlabeled samples. In pr...