3204 search results - page 110 / 641 » The Alcuin Number of a Graph |
ICC
2007
IEEE
14 years 2 months ago
2007
IEEE
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...
CDC
2010
IEEE
13 years 3 months ago
2010
IEEE
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 ...
ICDT
2007
ACM
14 years 2 months ago
2007
ACM
We consider random graphs, and their extensions to random structures, with edge probabilities of the form βn−α , where n is the number of vertices, α, β are fixed and α >...
GD
2004
Springer
14 years 1 months ago
2004
Springer
We present an O(n) time algorithm for simultaneous embedding of pairs of planar graphs on the O(n2 )×O(n2 ) grid, with at most three bends per edge, where n is the number of verti...
JDA
2010
13 years 2 months ago
2010
We present subexponential parameterized algorithms on planar graphs for a family of problems of the following shape: given a graph, find a connected (induced) subgraph with bounde...