منابع مشابه
Universal Bayesian Measures and Universal Histogram Sequences
Consider universal data compression: the length l(x) of sequence x ∈ A with finite alphabet A and length n satisfies Kraft’s inequality over A, and − 1 n log P (x) Qn(xn) almost surely converges to zero as n grows for the Q(x) = 2 ) and any stationary ergodic source P . In this paper, we say such a Q is a universal Bayesian measure. We generalize the notion to the sources in which the random va...
متن کاملBounds on Universal Sequences
Universal sequences for graphs, a concept introduced by Aleliunas [M. are studied. By letting U(d, n) denote the minimum length of a universal sequence for d-regular undirected graphs with n nodes, the latter paper has proved the upper bound U(d, n)= O(d2r log n) using a probabilistic argument. Here a lower bound of U(2, n)-(n log n) is proved from which U(d, n)-l'I(n log n) for all d is deduce...
متن کاملUniversal Traversal Sequences
In this article we discuss a purely combinatorial problem, the construction of short universal traversal sequences, and its relationship to questions about logspace computation. We state the problem formally, show how it arises naturally in complexity theory, and review some of the known partial results. A basic introduction to complexity theory can be found in 6]. The P vs. NP problem is recog...
متن کاملUniversal Prediction of Individual Sequences
Unlike standard statistical approaches to forecasting, prediction of individual sequences does not impose any probabilistic assumption on the data-generating mechanism. Yet, prediction algorithms can be constructed that work well for all possible sequences, in the sense that their performance is always nearly as good as the best forecasting strategy in a given reference class. In this report, t...
متن کاملUniversal Traversal Sequences with Backtracking
In this paper we introduce a new notion of traversal sequences that we call exploration sequences. Exploration sequences share many properties with the traversal sequences defined in [AKL+], but they also exhibit some new properties. In particular, they have an ability to backtrack, and their random properties are robust under choice of the probability distribution on labels. Further, we presen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applicable Algebra in Engineering, Communication and Computing
سال: 1997
ISSN: 0938-1279,1432-0622
DOI: 10.1007/s002000050071