Sciweavers

3268 search results - page 180 / 654
» The hub number of a graph
Sort
View
ICC
2007
IEEE
119views Communications» more  ICC 2007»
16 years 26 days ago
Graph-Based Detector for BLAST Architecture
Abstract— We propose belief propagation (BP) based detection algorithms for the Bell labs layered space-time (BLAST) architectures. We first develop a full complexity BP algorit...
Jun Hu, Tolga M. Duman
FLAIRS
2006
15 years 8 months ago
Improving Modularity in Genetic Programming Using Graph-Based Data Mining
We propose to improve the efficiency of genetic programming, a method to automatically evolve computer programs. We use graph-based data mining to identify common aspects of highl...
Istvan Jonyer, Akiko Himes
CORR
2008
Springer
124views Education» more  CORR 2008»
15 years 6 months ago
A New Upper Bound for Max-2-Sat: A Graph-Theoretic Approach
In MaxSat, we ask for an assignment which satisfies the maximum number of clauses for a boolean formula in CNF. We present an algorithm yielding a run time upper bound of O (2 K 6....
Daniel Raible, Henning Fernau
ENDM
2006
70views more  ENDM 2006»
15 years 6 months ago
Quasirandomness in Graphs
Jim Propp's rotor router model is a simple deterministic analogue of a random walk. Instead of distributing chips randomly, it serves the neighbors in a fixed order. We analy...
Benjamin Doerr, Tobias Friedrich
CDC
2010
IEEE
122views Control Systems» more  CDC 2010»
15 years 1 months ago
A lower bound for distributed averaging algorithms on the line graph
We derive lower bounds on the convergence speed of a widely used class of distributed averaging algorithms. In particular, we prove that any distributed averaging algorithm whose ...
Alexander Olshevsky, John N. Tsitsiklis