Prefetching constitutes a valuable tool toward the goal of efficient Web surfing. As result, estimating amount resources that need to be preloaded during surfer's browsing becomes an important task. In this regard, prefetching can modeled as two-player combinatorial game (Fomin et al. (2014) [6] ), where surfer and marker alternately play on given graph (representing graph). During its turn, ch...

We study the Online Budgeted Maximum Coverage problem. Subsets of a weighted ground set U arrive one by one, where each has cost. The online algorithm to select collection sets, under constraint that their cost is at most given budget. Upon arrival must decide whether accept or irrevocably reject arriving set, and it may also drop previously accepted sets. goal maximize total weight elements co...

In this paper we discuss maximum likelihood estimation when some observations are missing in mixed graphical interaction models assuming a conditional Gaussian distribution as introduced by Lauritzen & Wermuth (1989). For the saturated case ML estimation with missing values via the EM algorithm has been proposed by Little & Schluchter (1985). We expand their results to the special restrictions ...