Results 1  10
of
1,011
Suffix arrays: A new method for online string searches
, 1991
"... A new and conceptually simple data structure, called a suffix array, for online string searches is introduced in this paper. Constructing and querying suffix arrays is reduced to a sort and search paradigm that employs novel algorithms. The main advantage of suffix arrays over suffix trees is that ..."
Abstract

Cited by 835 (0 self)
 Add to MetaCart
in some cases slightly better than) suffix trees. The only drawback is that in those instances where the underlying alphabet is finite and small, suffix trees can be constructed in O(N) time in the worst case, versus O(N log N) time for suffix arrays. However, we give an augmented algorithm that
The Capacity of LowDensity ParityCheck Codes Under MessagePassing Decoding
, 2001
"... In this paper, we present a general method for determining the capacity of lowdensity paritycheck (LDPC) codes under messagepassing decoding when used over any binaryinput memoryless channel with discrete or continuous output alphabets. Transmitting at rates below this capacity, a randomly chos ..."
Abstract

Cited by 574 (9 self)
 Add to MetaCart
In this paper, we present a general method for determining the capacity of lowdensity paritycheck (LDPC) codes under messagepassing decoding when used over any binaryinput memoryless channel with discrete or continuous output alphabets. Transmitting at rates below this capacity, a randomly
The Infinite Hidden Markov Model
 Machine Learning
, 2002
"... We show that it is possible to extend hidden Markov models to have a countably infinite number of hidden states. By using the theory of Dirichlet processes we can implicitly integrate out the infinitely many transition parameters, leaving only three hyperparameters which can be learned from data. Th ..."
Abstract

Cited by 637 (41 self)
 Add to MetaCart
. These three hyperparameters define a hierarchical Dirichlet process capable of capturing a rich set of transition dynamics. The three hyperparameters control the time scale of the dynamics, the sparsity of the underlying statetransition matrix, and the expected number of distinct hidden states in a finite
Typesetting Concrete Mathematics
 TUGBOAT
, 1989
"... ... tried my best to make the book mathematically interesting, but I also knew that it would be typographically interestingbecause it would be the first major use of a new typeface by Hermann Zapf, commissioned by the American Mathematical Society. This typeface, called AMS Euler, had been carefull ..."
Abstract

Cited by 661 (1 self)
 Add to MetaCart
. The underlying philosophy of Zapf's Euler design was to capture the flavor of mathematics as it might be written by a mathematician with excellent handwriting. For example, one of the earmarks of AMS Euler is its zero, 'O', which is slightly pointed at the top because a handwritten zero rarely
Hidden Markov processes
 IEEE Trans. Inform. Theory
, 2002
"... Abstractâ€”An overview of statistical and informationtheoretic aspects of hidden Markov processes (HMPs) is presented. An HMP is a discretetime finitestate homogeneous Markov chain observed through a discretetime memoryless invariant channel. In recent years, the work of Baum and Petrie on finite ..."
Abstract

Cited by 264 (5 self)
 Add to MetaCart
state finitealphabet HMPs was expanded to HMPs with finite as well as continuous state spaces and a general alphabet. In particular, statistical properties and ergodic theorems for relative entropy densities of HMPs were developed. Consistency and asymptotic normality of the maximumlikelihood (ML) parameter
Alphabetical Index
, 2012
"... personal initials under first letter e.g. AJB is in the 'A ' section; St filed as Saint page numbers: bold and underlined for front page features; bold for other major items; italics for photographs, and other illustrations; suffix for adverts (ad), corrections (corr), Editorial (Ed), lett ..."
Abstract
 Add to MetaCart
personal initials under first letter e.g. AJB is in the 'A ' section; St filed as Saint page numbers: bold and underlined for front page features; bold for other major items; italics for photographs, and other illustrations; suffix for adverts (ad), corrections (corr), Editorial (Ed
Realcoded genetic algorithms, virtual alphabets, and blocking
, 1990
"... goldbergvmd cso uiuc edu This paper presents a theory of convergence for realcoded genetic algorithmsGAs that use oatingpoint or other highcardinality codings in their chromosomes The theory is consistent with the theory of schemata and postulates that selection dominates early GA performance and r ..."
Abstract

Cited by 107 (7 self)
 Add to MetaCart
and restricts subsequent search to intervals with aboveaverage function value dimension by dimension These intervals may be further subdivided on the basis of their attraction under genetic hillclimbing Each of these subintervals is called a virtual character and the collection of characters along a given
On the Origins of the Alphabet by
, 2009
"... www.sinoplatonic.org SINOPLATONIC PAPERS is an occasional series edited by Victor H. Mair. The purpose of the series is to make available to specialists and the interested public the results of research that, because of its unconventional or controversial nature, might otherwise go unpublished. Th ..."
Abstract
 Add to MetaCart
blackandwhite contrast. SinoPlatonic Papers is licensed under the Creative Commons Attribution
The LOCOI Lossless Image Compression Algorithm: Principles and Standardization into JPEGLS
 IEEE TRANSACTIONS ON IMAGE PROCESSING
, 2000
"... LOCOI (LOw COmplexity LOssless COmpression for Images) is the algorithm at the core of the new ISO/ITU standard for lossless and nearlossless compression of continuoustone images, JPEGLS. It is conceived as a "low complexity projection" of the universal context modeling paradigm, match ..."
Abstract

Cited by 253 (11 self)
 Add to MetaCart
for capturing highorder dependencies. The model is tuned for efficient performance in conjunction with an extended family of Golombtype codes, which are adaptively chosen, and an embedded alphabet extension for coding of lowentropy image regions. LOCOI attains compression ratios similar or superior to those
Alphabet Partitioning Techniques for
 IEEE Transactions on Communications
"... Practical applications that employ entropy coding for large alphabets often partition the alphabet set into two or more layers and encode each symbol by using some suitable prefix coding for each layer. In this paper, we formulate the problem of finding an alphabet partitioning for the design of ..."
Abstract
 Add to MetaCart
algorithm whose running time is linear in the length of the input sequence, irrespective of the underlying alphabet size. Although our dynamic programming and greedy algorithms do not provide a globally optimal solution for the alphabet partitioning problem, experimental results demonstrate
Results 1  10
of
1,011