Asymptotic growth of Markoff-Hurwitz numbers
Arthur Baragar (1994)
Compositio Mathematica
Similarity:
Arthur Baragar (1994)
Compositio Mathematica
Similarity:
Symeon Bozapalidis, Olympia Louscou–Bozapalidou (2010)
RAIRO - Theoretical Informatics and Applications
Similarity:
Word and tree codes are studied in a common framework, that of polypodes which are sets endowed with a substitution like operation. Many examples are given and basic properties are examined. The code decomposition theorem is valid in this general setup.
Paulo E. D. Pinto, Fábio Protti, Jayme L. Szwarcfiter (2010)
RAIRO - Theoretical Informatics and Applications
Similarity:
Motivated by a problem posed by Hamming in 1980, we define even codes. They are Huffman type prefix codes with the additional property of being able to detect the occurrence of an odd number of 1-bit errors in the message. We characterize optimal even codes and describe a simple method for constructing the optimal codes. Further, we compare optimal even codes with Huffman codes for equal frequencies. We show that the maximum encoding in an optimal even code is at most two bits larger...
Michal Krátký, Tomáš Skopal, Václav Snášel (2004)
Kybernetika
Similarity:
The area of Information Retrieval deals with problems of storage and retrieval within a huge collection of text documents. In IR models, the semantics of a document is usually characterized using a set of terms. A common need to various IR models is an efficient term retrieval provided via a term index. Existing approaches of term indexing, e. g. the inverted list, support efficiently only simple queries asking for a term occurrence. In practice, we would like to exploit some more sophisticated...
Tony W. Lai, Derick Wood (1994)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
S.A. Choudum, S. Lavanya (2008)
Discussiones Mathematicae Graph Theory
Similarity:
We inductively describe an embedding of a complete ternary tree Tₕ of height h into a hypercube Q of dimension at most ⎡(1.6)h⎤+1 with load 1, dilation 2, node congestion 2 and edge congestion 2. This is an improvement over the known embedding of Tₕ into Q. And it is very close to a conjectured embedding of Havel [3] which states that there exists an embedding of Tₕ into its optimal hypercube with load 1 and dilation 2. The optimal hypercube has dimension ⎡(log₂3)h⎤ ( = ⎡(1.585)h⎤) or...