16 search results - page 2 / 4 » Graphs induced by Gray codes |
DCC
2002
IEEE
14 years 5 months ago
2002
IEEE
Scalar quantizers with uniform encoders and channel optimized decoders are studied for uniform sources and binary symmetric channels. It is shown that the Natural Binary Code and ...
IWOCA
2009
Springer
14 years 15 days ago
2009
Springer
An n-bit (cyclic) Gray code is a (cyclic) sequence of all n-bit strings such that consecutive strings differ in a single bit. We describe an algorithm which for every positive int...
JCT
2010
13 years 4 months ago
2010
Abstract. A graph is connected-homogeneous if any isomorphism between finite connected induced subgraphs extends to an automorphism of the graph. In this paper we classify the cou...
WAW
2009
Springer
14 years 16 days ago
2009
Springer
Since the first investigations on web graph compression, it has been clear that the ordering of the nodes of the graph has a fundamental influence on the compression rate (usuall...
CC
2006
Springer
13 years 9 months ago
2006
Springer
We introduce a new class of compiler heuristics: hybrid optimizations. Hybrid optimizations choose dynamically at compile time which optimization algorithm to apply from a set of d...