1591 search results - page 220 / 319 » Random lifts of graphs |
157
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
Abstract—We initiate the probabilistic analysis of linear programming (LP) decoding of low-density parity-check (LDPC) codes. Specifically, we show that for a random LDPC code e...
139
click to vote
TIT
2008
15 years 6 months ago
2008
The problem of computing functions of values at the nodes in a network in a fully distributed manner, where nodes do not have unique identities and make decisions based only on loc...
208
click to vote
CVPR
2009
IEEE
17 years 1 months ago
2009
IEEE
Global shape information is an effective top-down complement
to bottom-up figure-ground segmentation as well
as a useful constraint to avoid drift during adaptive tracking.
We p...
163
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
The Maximum Betweenness Centrality problem (MBC) can be defined as follows. Given a graph find a k-element node set C that maximizes the probability of detecting communication be...
175
click to vote
JITECH
2010
15 years 4 months ago
2010
This paper employs the network perspective to study patterns and structures of intraorganizational learning networks. The theoretical background draws from cognitive theories, the...