In this paper, we examine on-line learning problems in which the target concept is allowed to change over time. In each trial a master algorithm receives predictions from a large ...
Hidden Markov Models (HMMs) are an useful and widely utilized approach to the modeling of data sequences. One of the problems related to this technique is finding the optimal stru...
—In this paper, we propose a technique to reduce the number of trellis states in BCJR-type algorithms, i.e., algorithms with a structure similar to that of the well-known algorit...
Giulio Colavolpe, Gian Luigi Ferrari, Riccardo Rah...
Analyzing data obtained from web server logs, so-called “clickstreams”, is rapidly becoming one of the most important activities for companies in any sector as most businesses...
Jesper Andersen, Anders Giversen, Allan H. Jensen,...
Instance based locality optimization 6 is a semi automatic program restructuring method that reduces the number of cache misses. The method imitates the human approach of consideri...