Results 1  10
of
680
Published online in Wiley InterScience (www.interscience.wiley.com). DOI: 10.1002/spe Revisiting Bounded Context BlockSorting Transformations
"... The BurrowsWheeler Transform (bwt) produces a permutation of a string X, denoted X ∗ , by sorting the n cyclic rotations of X into full lexicographical order, and taking the last column of the resulting n × n matrix to be X ∗. The transformation is reversible in O(n) time. In this paper, we conside ..."
Abstract
 Add to MetaCart
The BurrowsWheeler Transform (bwt) produces a permutation of a string X, denoted X ∗ , by sorting the n cyclic rotations of X into full lexicographical order, and taking the last column of the resulting n × n matrix to be X ∗. The transformation is reversible in O(n) time. In this paper, we
Quantum complexity theory
 in Proc. 25th Annual ACM Symposium on Theory of Computing, ACM
, 1993
"... Abstract. In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s model of a quantum Turing machine (QTM) [Proc. Roy. Soc. London Ser. A, 400 (1985), pp. 97–117]. This constructi ..."
Abstract

Cited by 574 (5 self)
 Add to MetaCart
be implemented and introduce some new, purely quantum mechanical primitives, such as changing the computational basis and carrying out an arbitrary unitary transformation of polynomially bounded dimension. We also consider the precision to which the transition amplitudes of a quantum Turing machine need
On Variants of BlockSorting Compression Using Context From Both the Left and Right
, 2000
"... The blocksorting text compression algorithm can be viewed as associating a context with each character to be compressed, and then sorting the characters on their contexts. Normally, the context associated with each character is the string to the left of the character. Recently, Ratushnyak sugges ..."
Abstract
 Add to MetaCart
to reverse the transformation is necessarily large, and so such transformations are unlikely to be of interest as part of a compression algorithm. 1 1 Introduction The first step of the blocksorting compression algorithm [1] transforms a string by sorting its characters on their leftcontexts. (The
An Analysis of the BurrowsWheeler Transform
 Journal of the ACM
, 2001
"... this paper we analyze two algorithms which use this technique. The first one is the original algorithm described by Burrows and Wheeler, which, despite its simplicity, outperforms the Gzip compressor. The second one uses an additional runlength encoding step to improve compression. We prove that th ..."
Abstract

Cited by 173 (13 self)
 Add to MetaCart
that the compression ratio of both algorithms can be bounded in terms of the kth order empirical entropy of the input string for any k 0. We make no assumptions on the input and we obtain bounds which hold in the worst case, that is, for every possible input string. All previous results for BlockSorting
The Context Trees of Block Sorting Compression
 IN PROCEEDINGS OF THE IEEE DATA COMPRESSION CONFERENCE, SNOWBIRD, UTAH, MARCH 30  APRIL 1
, 1998
"... The BurrowsWheeler transform (BWT)andblock sorting compression are closely related to the context trees of PPM. The usual approach of treating BWT as merely a permutation is not able to fully exploit this relation. We show that ..."
Abstract

Cited by 24 (0 self)
 Add to MetaCart
The BurrowsWheeler transform (BWT)andblock sorting compression are closely related to the context trees of PPM. The usual approach of treating BWT as merely a permutation is not able to fully exploit this relation. We show that
Text Compression using Recency Rank with Context and Relation to Context Sorting, Block Sorting and PPM*
 IN PROC. INT. CONFERENCE ON COMPRESSION AND COMPLEXITY OF SEQUENCES (SEQUENCES '97). IEEE COMPUTER SOCIETY TCC
, 1997
"... Recently block sorting compression scheme was developed and relation to statistical scheme was studied, but theoretical analysis of performance has not been studied well. Context sorting is a compression scheme based on context similarity and it is regarded as an online version of the block sorting ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
Recently block sorting compression scheme was developed and relation to statistical scheme was studied, but theoretical analysis of performance has not been studied well. Context sorting is a compression scheme based on context similarity and it is regarded as an online version of the block sorting
Containment and equivalence for a fragment of XPath
 JOURNAL OF THE ACM
, 2004
"... XPath is a language for navigating an XML document and selecting a set of element nodes. XPath expressions are used to query XML data, describe key constraints, express transformations, and reference elements in remote documents. This article studies the containment and equivalence problems for a ..."
Abstract

Cited by 142 (0 self)
 Add to MetaCart
XPath is a language for navigating an XML document and selecting a set of element nodes. XPath expressions are used to query XML data, describe key constraints, express transformations, and reference elements in remote documents. This article studies the containment and equivalence problems for a
Conjunction revisited
 NeuroImage
, 2005
"... The aim of this note is to revisit the analysis of conjunctions in imaging data. We review some conceptual issues that have emerged from recent discussion (Nichols, T., Brett, M., Andersson, J., Wager, T., Poline, J.B., this issue. Valid Conjunction Inference with the Minimum Statistic.) and reform ..."
Abstract

Cited by 49 (0 self)
 Add to MetaCart
) for inferences about a conjunction of k = n effects, over n tests. This is the key point made by Nichols et al., who suggest a procedure based on supremum P values that provides an upper bound on FPR for k = n. Although valid, this is a very conservative procedure, particularly in the context of multiple
Greibach Normal Form Transformation, Revisited
 Information and Computation
, 1997
"... We develop a new method for placing a given contextfree grammar into Greibach normal form with only polynomial increase of its size. Starting with an arbitrary "free contextfree grammar G, we transform G into an equivalent contextfree grammar H in extended Greibach normal form; i.e., in ..."
Abstract

Cited by 17 (0 self)
 Add to MetaCart
We develop a new method for placing a given contextfree grammar into Greibach normal form with only polynomial increase of its size. Starting with an arbitrary "free contextfree grammar G, we transform G into an equivalent contextfree grammar H in extended Greibach normal form; i
Backwards Search in Context Bound Text Transformations
"... Abstract—The BurrowsWheeler Transform (BWT) is the basis for many of the most effective compression and selfindexing methods used today. A key to the versatility of the BWT is the ability to search for patterns directly in the transformed text. A backwards search for a pattern P can be performed on ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
of the BWT whereby rotations are only sorted to a depth k, commonly referred to as a context bound transform. Interestingly, this BWT variant can be used to mimic a kgram index, which are used in a variety of applications that need to efficiently return occurrences in text position order. In this paper, we
Results 1  10
of
680