Sciweavers

1949 search results - page 211 / 390
» Random graphs on surfaces
Sort
View
133
Voted
CORR
2004
Springer
115views Education» more  CORR 2004»
15 years 4 months ago
Bounds on the decoding complexity of punctured codes on graphs
We present two sequences of ensembles of non-systematic irregular repeat-accumulate codes which asymptotically (as their block length tends to infinity) achieve capacity on the bi...
Henry D. Pfister, Igal Sason, Rüdiger L. Urba...
137
Voted
ECCC
2000
113views more  ECCC 2000»
15 years 4 months ago
Candidate One-Way Functions Based on Expander Graphs
Abstract. We suggest a candidate one-way function using combinatorial constructs such as expander graphs. These graphs are used to determine a sequence of small overlapping subsets...
Oded Goldreich
125
Voted
JGT
2010
81views more  JGT 2010»
15 years 3 months ago
Cycles and paths in edge-colored graphs with given degrees
Sufficient degree conditions for the existence of properly edge-colored cycles and paths in edge-colored graphs, multigraphs and random graphs are inverstigated. In particular, we...
A. Abouelaoualim, Kinkar Chandra Das, Wenceslas Fe...
CORR
2011
Springer
188views Education» more  CORR 2011»
15 years 2 days ago
Planar Cycle Covering Graphs
We describe a new variational lower-bound on the minimum energy configuration of a planar binary Markov Random Field (MRF). Our method is based on adding auxiliary nodes to every...
Julian Yarkony, Alexander T. Ihler, Charless C. Fo...
145
Voted
ECCV
2004
Springer
15 years 10 months ago
Multi-label Image Segmentation for Medical Applications Based on Graph-Theoretic Electrical Potentials
Abstract. A novel method is proposed for performing multi-label, semi-automated image segmentation. Given a small number of pixels with user-defined labels, one can analytically (...
Leo Grady, Gareth Funka-Lea