Sciweavers

1591 search results - page 91 / 319
» Random lifts of graphs
Sort
View
CPC
2010
122views more  CPC 2010»
15 years 6 months ago
The Longest Minimum-Weight Path in a Complete Graph
We consider the minimum-weight path between any pair of nodes of the n-vertex complete graph in which the weights of the edges are i.i.d. exponentially distributed random variable...
Louigi Addario-Berry, Nicolas Broutin, Gábo...
WOWMOM
2009
ACM
143views Multimedia» more  WOWMOM 2009»
16 years 25 days ago
Improving partial cover of Random Walks in large-scale Wireless Sensor Networks
Random Walks (RWs) have been considered for information dissemination in large scale, dynamic and unstructured environments, as they are scalable, robust to topology changes and d...
Leonidas Tzevelekas, Ioannis Stavrakakis
APPROX
2008
Springer
119views Algorithms» more  APPROX 2008»
15 years 8 months ago
The Complexity of Distinguishing Markov Random Fields
Abstract. Markov random fields are often used to model high dimensional distributions in a number of applied areas. A number of recent papers have studied the problem of reconstruc...
Andrej Bogdanov, Elchanan Mossel, Salil P. Vadhan
CDC
2010
IEEE
186views Control Systems» more  CDC 2010»
15 years 1 months ago
Approximation and limiting behavior of random models
In this paper, we investigate limiting behavior of linear dynamic systems driven by random stochastic matrices. We introduce and study the new concepts of partial ergodicity and 1-...
Behrouz Touri, Angelia Nedic
ICML
2004
IEEE
16 years 7 months ago
Kernel conditional random fields: representation and clique selection
Kernel conditional random fields (KCRFs) are introduced as a framework for discriminative modeling of graph-structured data. A representer theorem for conditional graphical models...
John D. Lafferty, Xiaojin Zhu, Yan Liu