Describes a sequential universal data compression procedure for binary tree sources that
performs the" double mixture." Using a context tree, this method weights in an efficient …

This paper is concerned with algorithms for prediction of discrete sequences over a finite
alphabet, using variable order Markov models. The class of such algorithms is large and in …

Книга посвящена теоретическим основам и практической реализации цифровых
видеоинформациониых систем. Материал содержит девять частей, состоящих из 23 …

Regularity is an important property of individual travel behavior, and the ability to measure it
enables advances in behavior modeling, mobility prediction, and customer analytics. In this …

The concept of context tree, usually defined for finite memory processes, is extended to
arbitrary stationary ergodic processes (with finite alphabet). These context trees are not …

This paper introduces a principled approach for the design of a scalable general
reinforcement learning agent. Our approach is based on a direct approximation of AIXI, a …

In this paper, we proposed a new method to extract travel patterns for transit riders from
different public transportation systems based on temporal motif, which is an emerging notion …

The rapid popularization of smartphones has contributed to the growth of online Instant
Messaging and SMS usage as an alternative way of communication. The increasing number …

Four estimators of the directed information rate between a pair of jointly stationary ergodic
finite-alphabet processes are proposed, based on universal probability assignments. The …

In this paper we describe the results of our investigations Supported by EU FP7 project
UNIQUE on the randomness and reliability of D flip-flops when used as a Physically …