Sciweavers

745 search results - page 36 / 149
» On Generating Random Network Structures: Connected Graphs
Sort
View
ECCV
2008
Springer
16 years 2 months ago
Sparse Long-Range Random Field and Its Application to Image Denoising
Many recent techniques for low-level vision problems such as image denoising are formulated in terms of Markov random field (MRF) or conditional random field (CRF) models. Nonethel...
Yunpeng Li, Daniel P. Huttenlocher
115
Voted
APPROX
2004
Springer
179views Algorithms» more  APPROX 2004»
15 years 5 months ago
Maximum Weight Independent Sets and Matchings in Sparse Random Graphs. Exact Results Using the Local Weak Convergence Method
ABSTRACT: Let G(n, c/n) and Gr(n) be an n-node sparse random graph and a sparse random rregular graph, respectively, and let I(n, r) and I(n, c) be the sizes of the largest indepen...
David Gamarnik, Tomasz Nowicki, Grzegorz Swirszcz
99
Voted
ICPR
2002
IEEE
16 years 1 months ago
Relational Graph Labelling Using Learning Techniques and Markov Random Fields
This paper introduces an approach for handling complex labelling problems driven by local constraints. The purpose is illustrated by two applications: detection of the road networ...
Denis Rivière, Jean-Francois Mangin, Jean-M...
WICOMM
2008
122views more  WICOMM 2008»
15 years 11 days ago
Energy and connectivity performance of routing groups in multi-radio multi-hop networks
This paper explores the logical device aggregation of terminals in future generation networks, where the availability of several different radio access techniques is integrated by...
Michele Rossi, Leonardo Badia, Paolo Giacon, Miche...
108
Voted
TCBB
2008
116views more  TCBB 2008»
15 years 12 days ago
Inferring Connectivity of Genetic Regulatory Networks Using Information-Theoretic Criteria
Recently, the concept of mutual information has been proposed for inferring the structure of genetic regulatory networks from gene expression profiling. After analyzing the limitat...
Wentao Zhao, Erchin Serpedin, Edward R. Dougherty