Sciweavers

6 search results - page 1 / 2
» An iterative approach to graph irregularity strength
Sort
View
DAM
2010
105views more  DAM 2010»
13 years 2 months ago
An iterative approach to graph irregularity strength
An assignment of positive integer weights to the edges of a simple graph G is called irregular if the weighted degrees of the vertices are all different. The irregularity strength,...
Michael Ferrara, Ronald J. Gould, Michal Karonski,...
TSP
2008
82views more  TSP 2008»
13 years 4 months ago
Fully Parallel Stochastic LDPC Decoders
Stochastic decoding is a new approach to iterative decoding on graphs. This paper presents a hardware architecture for fully parallel stochastic low-density parity-check (LDPC) dec...
Saeed Sharifi Tehrani, Shie Mannor, Warren J. Gros...
AAECC
2006
Springer
105views Algorithms» more  AAECC 2006»
13 years 11 months ago
LDPC Codes for Fading Channels: Two Strategies
Abstract. This paper compares two approaches to reliable communication over fading channels using low-density parity check (LDPC) codes. The particular model considered is the bloc...
Xiaowei Jin, Teng Li, Thomas E. Fuja, Oliver M. Co...
DFG
2009
Springer
13 years 11 months ago
Group-Level Analysis and Visualization of Social Networks
Social network analysis investigates the structure of relations amongst social actors. A general approach to detect patterns of interaction and to filter out irregularities is to ...
Michael Baur, Ulrik Brandes, Jürgen Lerner, D...
BMCBI
2008
138views more  BMCBI 2008»
13 years 5 months ago
CASCADE: a novel quasi all paths-based network analysis algorithm for clustering biological interactions
Background: Quantitative characterization of the topological characteristics of protein-protein interaction (PPI) networks can enable the elucidation of biological functional modu...
Woochang Hwang, Young-Rae Cho, Aidong Zhang, Mural...