134 search results - page 6 / 27 » A New Tight Upper Bound on the Transposition Distance |
JDA
2011
14 years 4 months ago
2011
It has recently been shown how to construct online, non-amortised approximate pattern matching algorithms for a class of problems whose distance functions can be classified as be...
TIT
2010
14 years 4 months ago
2010
We investigate error-correcting codes for a the rank-modulation scheme with an application to flash memory devices. In this scheme, a set of n cells stores information in the permu...
TCOM
2008
14 years 9 months ago
2008
In this paper, we derive closed form upper bounds on the error probability of low-density parity-check (LDPC) coded modulation schemes operating on quasi-static fading channels. Th...
SDM
2009
SIAM
15 years 6 months ago
2009
SIAM
Most data mining operations include an integral search component at their core. For example, the performance of similarity search or classification based on Nearest Neighbors is ...
FOCS
2000
IEEE
15 years 2 months ago
2000
IEEE
We give new bounds on the circuit complexity of the quantum Fourier transform (QFT). We give an upper bound of Ç´ÐÓ Ò · ÐÓ ÐÓ ´½ µµ on the circuit depth for computin...