41 search results - page 2 / 9 » On the Huffman and Alphabetic Tree Problem with General Cost... |
CORR
2011
Springer
13 years 2 months ago
2011
Springer
—In this paper we consider an interacting two-agent sequential decision-making problem consisting of a Markov source process, a causal encoder with feedback, and a causal decoder...
PODC
2012
ACM
11 years 9 months ago
2012
ACM
Multi-party communication complexity involves distributed computation of a function over inputs held by multiple distributed players. A key focus of distributed computing research...
Publication
In this paper we address the problem of defining a measure of diversity for a population of individuals whose genome can be subjected to major reorganizations during the evolution...
ISAAC
2005
Springer
14 years 25 days ago
2005
Springer
We consider generalizations of the k-source sum of vertex eccentricity problem (k-SVET) and the k-source sum of source eccentricity problem (k-SSET) [1], which we call SDET and SSE...
ALGORITHMICA
1999
13 years 7 months ago
1999
We discuss an intrinsic generalization of the suffix tree, designed to index a string of length n which has a natural partitioning into m multicharacter substrings or words. This ...