175 search results - page 17 / 35 » Bounds for Permutation Rate-Distortion |
89
Voted
COMBINATORICS
2004
15 years 3 months ago
2004
A word is abelian square-free if it does not contain two adjacent subwords which are permutations of each other. Over an alphabet k on k letters, an abelian squarefree word is max...
101
Voted
JCT
2008
15 years 3 months ago
2008
A three-dimensional analogue of the classical direction problem is proposed and an asymptotically sharp bound for the number of directions determined by a nonplanar set in AG(3, p)...
133
Voted
COCO
2010
Springer
15 years 5 months ago
2010
Springer
—A space bounded Stack Machine is a regular Turing Machine with a read-only input tape, several space bounded read-write work tapes, and an unbounded stack. Stack Machines with a...
145
Voted
ICC
2007
IEEE
15 years 10 months ago
2007
IEEE
— We address a lifetime maximization problem for a single-hop wireless sensor network where multiple sensors encode and communicate their measurements of a Gaussian random source...
131
Voted
AB
2007
Springer
15 years 7 months ago
2007
Springer
Given a permutation , the application of prefix reversal f(i) to reverses the order of the first i elements of . The problem of Sorting By Prefix Reversals (also known as pancake ...