Sciweavers

116 search results - page 9 / 24
» Suballowable sequences of permutations
Sort
View
TIFS
2008
154views more  TIFS 2008»
13 years 7 months ago
On the Distinguishability of Distance-Bounded Permutations in Ordered Channels
Ordered channels, such as those provided by Internet protocol and transmission control protocol protocols, rely on sequence numbers to recover from packet reordering due to network...
Juan M. Estévez-Tapiador, Julio Césa...
EJC
2010
13 years 7 months ago
Descent polynomials for permutations with bounded drop size
Abstract. Motivated by juggling sequences and bubble sort, we examine permutations on the set {1, 2, . . . , n} with d descents and maximum drop size k. We give explicit formulas f...
Fan R. K. Chung, Anders Claesson, Mark Dukes, Rona...
ICPR
2008
IEEE
14 years 2 months ago
Birkhoff polytopes, heat kernels and graph complexity
In this paper we use doubly stochastic matrices to establish a link between Birkhoff polytopes and heat kernels on graphs. Based on this analysis we construct a multi-dimensional ...
Francisco Escolano, Edwin R. Hancock, Miguel Angel...
COMBINATORICS
2002
65views more  COMBINATORICS 2002»
13 years 7 months ago
Sorting with a Forklift
A fork stack is a generalised stack which allows pushes and pops of several items at a time. We consider the problem of determining which input streams can be sorted using a singl...
Michael H. Albert, Mike D. Atkinson
CORR
2011
Springer
161views Education» more  CORR 2011»
13 years 2 months ago
Generalized Gray Codes for Local Rank Modulation
—We consider the local rank-modulation scheme in which a sliding window going over a sequence of real-valued variables induces a sequence of permutations. Local rankmodulation is...
Eyal En Gad, Michael Langberg, Moshe Schwartz, Jeh...