Sciweavers

49 search results - page 1 / 10
» A q-enumeration of alternating permutations
Sort
View
COMBINATORICS
2007
164views more  COMBINATORICS 2007»
13 years 4 months ago
Longest Alternating Subsequences in Pattern-Restricted Permutations
We determine the limiting distributions of the longest alternating subsequence for pattern-restricted permutations in which the pattern is any one of the six patterns of length th...
Ghassan Firro, Toufik Mansour, Mark C. Wilson
TCS
2008
13 years 4 months ago
Simple permutations: Decidability and unavoidable substructures
We prove that it is decidable whether a finitely based permutation class contains infinitely many simple permutations, and establish an unavoidable substructure result for simple ...
Robert Brignall, Nikola Ruskuc, Vincent Vatter
IJES
2008
102views more  IJES 2008»
13 years 5 months ago
Alternative application-specific processor architectures for fast arbitrary bit permutations
Block ciphers are used to encrypt data and provide data confidentiality. For interoperability reasons, it is desirable to support a variety of block ciphers efficiently. Of the bas...
Zhijie Jerry Shi, Xiao Yang, Ruby B. Lee
EJC
2010
13 years 5 months ago
A q-enumeration of alternating permutations
A classical result of Euler states that the tangent numbers are an alternating sum of Eulerian numbers. A dual result of Roselle states that the secant numbers can be obtained by a...
Matthieu Josuat-Vergès
ICMCS
2006
IEEE
146views Multimedia» more  ICMCS 2006»
13 years 11 months ago
Permutation-Based Low-Complexity Alternate Coding in Multi-View H.264/AVC
1 Low bitrates enabled by the H.264/AVC standard come at the cost of significant decoding complexity. The problem is exacerbated when multi-view video coding (MVC), presently being...
Daniel Socek, Dubravko Culibrk, Hari Kalva, Oge Ma...