Sciweavers

15 search results - page 2 / 3
» Shape-Wilf-Ordering on Permutations of Length 3
Sort
View
COMBINATORICS
2004
86views more  COMBINATORICS 2004»
13 years 5 months ago
Multiple Pattern Avoidance with respect to Fixed Points and Excedances
We study the distribution of the statistics `number of fixed points' and `number of excedances' in permutations avoiding subsets of patterns of length 3. We solve all th...
Sergi Elizalde
ICALP
2005
Springer
13 years 11 months ago
Simple Extractors via Constructions of Cryptographic Pseudo-random Generators
Trevisan has shown that constructions of pseudo-random generators from hard functions (the Nisan-Wigderson approach) also produce extractors. We show that constructions of pseudo-r...
Marius Zimand
ICMCS
2007
IEEE
126views Multimedia» more  ICMCS 2007»
13 years 11 months ago
Hierarchical Blind Watermarking of 3D Triangular Meshes
An original hierarchical watermarking scheme is proposed in this paper. A geometrically robust watermark and a high-capacity watermark are inserted in different resolution levels ...
Kai Wang, Guillaume Lavoué, Florence Denis,...
EJC
2006
13 years 5 months ago
Hamiltonicity of digraphs for universal cycles of permutations
The digraphs P(n, k) have vertices corresponding to length k permutations of an n set and arcs corresponding to (k + 1) permutations. Answering a question of Starling, Klerlein, K...
Garth Isaak
DAM
2010
107views more  DAM 2010»
13 years 5 months ago
Codes from lattice and related graphs, and permutation decoding
Codes of length n2 and dimension 2n - 1 or 2n - 2 over the field Fp, for any prime p, that can be obtained from designs associated with the complete bipartite graph Kn,n and its l...
Jennifer D. Key, Bernardo Gabriel Rodrigues