Sciweavers

131 search results - page 21 / 27
» Colouring Random Regular Graphs
Sort
View
ICML
2009
IEEE
14 years 8 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
SAC
2010
ACM
14 years 2 months 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
SIGMETRICS
2005
ACM
14 years 1 months ago
On lifetime-based node failure and stochastic resilience of decentralized peer-to-peer networks
—To model P2P networks that are commonly faced with high rates of churn and random departure decisions by end-users, this paper investigates the resilience of random graphs to li...
Derek Leonard, Vivek Rai, Dmitri Loguinov
IFM
2010
Springer
190views Formal Methods» more  IFM 2010»
13 years 6 months ago
On Model Checking Techniques for Randomized Distributed Systems
Abstract. The automata-based model checking approach for randomized distributed systems relies on an operational interleaving semantics of the system by means of a Markov decision ...
Christel Baier
JMLR
2010
158views more  JMLR 2010»
13 years 2 months ago
Topology Selection in Graphical Models of Autoregressive Processes
An algorithm is presented for topology selection in graphical models of autoregressive Gaussian time series. The graph topology of the model represents the sparsity pattern of the...
Jitkomut Songsiri, Lieven Vandenberghe