Sciweavers

116 search results - page 5 / 24
» Suballowable sequences of permutations
Sort
View
ICMCS
2006
IEEE
146views Multimedia» more  ICMCS 2006»
14 years 1 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...
COMBINATORICS
2007
164views more  COMBINATORICS 2007»
13 years 7 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
TIT
2011
141views more  TIT 2011»
13 years 2 months ago
Near-Complementary Sequences With Low PMEPR for Peak Power Control in Multicarrier Communications
New families of near-complementary sequences are presented for peak power control in multicarrier communications. A framework for near-complementary sequences is given by the expl...
Nam Yul Yu, Guang Gong
JDA
2008
122views more  JDA 2008»
13 years 7 months ago
An approximation algorithm for sorting by reversals and transpositions
Abstract. Genome rearrangement algorithms are powerful tools to analyze gene orders in molecular evolution. Analysis of genomes evolving by reversals and transpositions leads to a ...
Atif Rahman, Swakkhar Shatabda, Masud Hasan
ISAAC
2010
Springer
230views Algorithms» more  ISAAC 2010»
13 years 5 months ago
Seidel Minor, Permutation Graphs and Combinatorial Properties
A permutation graph is an intersection graph of segments lying between two parallel lines. A Seidel complementation of a finite graph at a vertex v consists in complementing the ed...
Vincent Limouzy