Sciweavers

59 search results - page 11 / 12
» The Chromatic Number of Random Regular Graphs
Sort
View
AI
2006
Springer
13 years 5 months ago
Controlled generation of hard and easy Bayesian networks: Impact on maximal clique size in tree clustering
This article presents and analyzes algorithms that systematically generate random Bayesian networks of varying difficulty levels, with respect to inference using tree clustering. ...
Ole J. Mengshoel, David C. Wilkins, Dan Roth
SAC
2010
ACM
14 years 19 days ago
Spanders: distributed spanning expanders
We consider self-stabilizing and self-organizing distributed construction of a spanner that forms an expander. The following results are presented. • A randomized technique to r...
Shlomi Dolev, Nir Tzachar
ICML
2009
IEEE
14 years 6 months ago
Graph construction and b-matching for semi-supervised learning
Graph based semi-supervised learning (SSL) methods play an increasingly important role in practical machine learning systems. A crucial step in graph based SSL methods is the conv...
Tony Jebara, Jun Wang, Shih-Fu Chang
CPC
2006
110views more  CPC 2006»
13 years 5 months ago
Bootstrap Percolation on Infinite Trees and Non-Amenable Groups
Abstract. Bootstrap percolation on an arbitrary graph has a random initial configuration, where each vertex is occupied with probability p, independently of each other, and a deter...
József Balogh, Yuval Peres, Gábor Pe...
SODA
2007
ACM
127views Algorithms» more  SODA 2007»
13 years 7 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 ...