Sciweavers

552 search results - page 13 / 111
» Observable Graphs
Sort
View
FOCS
2007
IEEE
15 years 8 months ago
Reconstruction for Models on Random Graphs
Consider a collection of random variables attached to the vertices of a graph. The reconstruction problem requires to estimate one of them given ‘far away’ observations. Sever...
Antoine Gerschenfeld, Andrea Montanari
102
Voted
CDC
2008
IEEE
109views Control Systems» more  CDC 2008»
15 years 8 months ago
Average consensus over small world networks: A probabilistic framework
— It has been observed that adding a few long range edges to certain graph topologies can significantly increase the rate of convergence for consensus algorithms. A notable exam...
Pedram Hovareshti, John S. Baras, Vijay Gupta
97
Voted
COMCOM
2008
100views more  COMCOM 2008»
15 years 2 months ago
Individual profile graphs for location management in PCS networks
A user's profile, for the purpose of location management in a personal communication service (PCS) network, is formalized as a subgraph of the network graph. This subgraph, t...
Chansophea Chuon, Sumanta Guha
ALT
2009
Springer
15 years 11 months ago
Learning Unknown Graphs
Motivated by a problem of targeted advertising in social networks, we introduce and study a new model of online learning on labeled graphs where the graph is initially unknown and...
Nicolò Cesa-Bianchi, Claudio Gentile, Fabio...
106
Voted
JAIR
1998
92views more  JAIR 1998»
15 years 1 months ago
The Gn, m Phase Transition is Not Hard for the Hamiltonian Cycle Problem
Using an improved backtrack algorithm with sophisticated pruning techniques, we revise previous observations correlating a high frequency of hard to solve Hamiltonian cycle instan...
Basil Vandegriend, Joseph C. Culberson