250 search results - page 24 / 50 » Constructing a Class of Symmetric Graphs |
DATE
2004
IEEE
14 years 6 days ago
2004
IEEE
Code optimization and high level synthesis can be posed as constraint satisfaction and optimization problems, such as graph coloring used in register allocation. Graph coloring is...
MFCS
2007
Springer
14 years 2 months ago
2007
Springer
Suppose we are given a graph G together with two proper vertex k-colourings of G, α and β. How easily can we decide whether it is possible to transform α into β by recolouring...
BMVC
2002
13 years 11 months ago
2002
In this paper, we construct a new class of deformable models using new biorthogonal wavelets, named Generalized Hermite Distributed Approximating Functional (g-HDAF) Wavelets. The...
JSAC
2008
13 years 8 months ago
2008
This paper investigates the joint iterative decoding of low-density parity-check (LDPC) codes and channels with memory. Sequences of irregular LDPC codes are presented that achieve...
DAM
2000
13 years 8 months ago
2000
The linear-width of a graph G is de ned to be the smallest integer k such that the edges of G can be arranged in a linear ordering e1;:::;er in such a way that for every i = 1;:::...