Sciweavers

654 search results - page 68 / 131
» Matrix Graph Grammars
Sort
View
GLOBECOM
2006
IEEE
14 years 2 months ago
When Does One Redundant Parity-Check Equation Matter?
— We analyze the effect of redundant parity-check equations on the error-floor performance of low-density paritycheck (LDPC) codes used over the additive white Gaussian noise (A...
Stefan Laendner, Thorsten Hehn, Olgica Milenkovic,...
ICPR
2010
IEEE
13 years 6 months ago
Semi-supervised Graph Learning: Near Strangers or Distant Relatives
In this paper, an easily implemented semi-supervised graph learning method is presented for dimensionality reduction and clustering, using the most of prior knowledge from limited...
Weifu Chen, Guocan Feng
ISCAS
2006
IEEE
118views Hardware» more  ISCAS 2006»
14 years 2 months ago
Complex network topologies and synchronization
Synchronization in networks with different topolo- is shown that for typical systems only three main scenarios gies is studied. We show that for a large class of oscillators there ...
Paolo Checco, Mario Biey, Gábor Vattay, Lju...
WAW
2009
Springer
136views Algorithms» more  WAW 2009»
14 years 3 months ago
Permuting Web Graphs
Since the first investigations on web graph compression, it has been clear that the ordering of the nodes of the graph has a fundamental influence on the compression rate (usuall...
Paolo Boldi, Massimo Santini, Sebastiano Vigna
ICCV
2003
IEEE
14 years 2 months ago
Edit Distance From Graph Spectra
This paper is concerned with computing graph edit distance. One of the criticisms that can be leveled at existing methods for computing graph edit distance is that it lacks the fo...
Antonio Robles-Kelly, Edwin R. Hancock