Sciweavers

4 search results - page 1 / 1
» Shuffling by Semi-Random Transpositions
Sort
View
FOCS
2004
IEEE
15 years 1 months ago
Shuffling by Semi-Random Transpositions
In the cyclic-to-random shuffle, we are given n cards arranged in a circle. At step k, we exchange the k'th card along the circle with a uniformly chosen random card. The pro...
Elchanan Mossel, Yuval Peres, Alistair Sinclair
79
Voted
IPPS
1999
IEEE
15 years 2 months ago
Shuffle Memory System
This paper proposes a new memory system called shuffle memory. The shuffle memory is a generalization of transposition memory that has been widely used in 2-D Discrete Cosine Tran...
Kichul Kim
APPROX
2006
Springer
130views Algorithms» more  APPROX 2006»
15 years 1 months ago
Robust Mixing
In this paper, we develop a new "robust mixing" framework for reasoning about adversarially modified Markov Chains (AMMC). Let P be the transition matrix of an irreducib...
Murali K. Ganapathy
BMCBI
2006
141views more  BMCBI 2006»
14 years 10 months ago
Asymptotic behaviour and optimal word size for exact and approximate word matches between random sequences
Background: The number of k-words shared between two sequences is a simple and effcient alignment-free sequence comparison method. This statistic, D2, has been used for the cluste...
Sylvain Forêt, Miriam R. Kantorovitz, Conrad...