69 search results - page 3 / 14 » Near automorphisms of cycles |
GC
2006
Springer
13 years 7 months ago
2006
Springer
A map is a connected topological graph cellularly embedded in a surface. For a given graph , its genus distribution of rooted maps and embeddings on orientable and non-orientable s...
JGT
2006
13 years 7 months ago
2006
We find a lower bound for the proportion of face boundaries of an embedded graph that are nearly
NSPW
2006
ACM
14 years 1 months ago
2006
ACM
In considering new security paradigms, it is often worthwhile to anticipate the direction and nature of future attack paradigms. We identify a class of attacks based on the idea o...
AAECC
2006
Springer
13 years 7 months ago
2006
Springer
Cyclicity of a convolutional code (CC) is relying on a nontrivial automorphism of the algebra F[x]/(xn - 1), where F is a finite field. A particular choice of the data leads to th...
ASPDAC
2006
ACM
14 years 1 months ago
2006
ACM
- We propose a near optimal hardware architecture for deblocking filter in H.264/MPEG-4 AVC. We propose a novel filtering order and a data reuse strategy that result in significant...