Sciweavers

118 search results - page 14 / 24
» A phase transition in the random transposition random walk
Sort
View
RSA
2011
124views more  RSA 2011»
13 years 3 months ago
Sparse random graphs with clustering
In 2007 we introduced a general model of sparse random graphs with independence between the edges. The aim of this paper is to present an extension of this model in which the edge...
Béla Bollobás, Svante Janson, Oliver...
ENDM
2007
74views more  ENDM 2007»
13 years 8 months ago
The order of the largest complete minor in a random graph
Let ccl(G) denote the order of the largest complete minor in a graph G (also called the contraction clique number) and let Gn,p denote a random graph on n vertices with edge probab...
Nikolaos Fountoulakis, Daniela Kühn, Deryk Os...
ICIP
2008
IEEE
14 years 2 months ago
Generalized ELL for detecting and tracking through illumination model changes
In previous work, we developed the Illum-PF-MT, which is the PFMT idea applied to the problem of tracking temporally and spatially varying illumination change. In many practical p...
Amit Kale, Namrata Vaswani
EUROPAR
2009
Springer
14 years 3 months ago
Uniform Sampling for Directed P2P Networks
Selecting a random peer with uniform probability across a peer-to-peer (P2P) network is a fundamental function for unstructured search, data replication, and monitoring algorithms....
Cyrus P. Hall, Antonio Carzaniga
MSS
2008
IEEE
88views Hardware» more  MSS 2008»
13 years 8 months ago
Cubical token systems
The paper deals with combinatorial and stochastic structures of cubical token systems. A cubical token system is an instance of a token system, which in turn is an instance of a t...
Sergei Ovchinnikov