Abstract— Prefetching is a widely used technique in modern data storage systems. We study the most widely used class of prefetching algorithms known as sequential prefetching. Th...
The success of popular algorithms such as k-means clustering or nearest neighbor searches depend on the assumption that the underlying distance functions reflect domain-specific n...
Many bioinformatics problems can implicitly depend on estimating large-scale covariance matrix. The traditional approaches tend to give rise to high variance and low accuracy esti...
We present the software tool “Web Graph Analyzer”. This tool is designed to perform a comprehensive analysis of the Web Graph structure. By Web Graph we mean a graph whose ver...
Konstantin Avrachenkov, Danil Nemirovsky, Natalia ...
This article presents and analyzes algorithms that systematically generate random Bayesian networks of varying difficulty levels, with respect to inference using tree clustering. ...