16 search results - page 3 / 4 » Graphs induced by Gray codes |
IADIS
2008
13 years 7 months ago
2008
We present how to efficiently mine a set of directed acyclic graphs (DAGs) for unconnected, both multi- or single-rooted, and induced fragments. With a new canonical form that is ...
DAM
2007
13 years 5 months ago
2007
In hardware design, it is necessary to simulate the anticipated behavior of the integrated circuit before it is actually cast in silicon. As simulation procedures are long due to ...
DM
2000
13 years 5 months ago
2000
Erdos proved that there are graphs with arbitrarily large girth and chromatic number. We study the extension of this for generalized chromatic numbers. Generalized graph coloring d...
JSAC
2010
13 years 4 months ago
2010
Abstract— There is a well-known error-floor phenomenon associated with iterative LDPC decoders which has delayed the use of LDPC codes in certain communication and storage syste...
ICSE
2008
IEEE-ACM
14 years 6 months ago
2008
IEEE-ACM
Because of the strong coupling of classes and the proliferation of unneeded class members induced by inheritance, the suggestion to use composition and delegation instead has beco...