In this paper, we propose a novel item-oriented algorithm, Random Walk Recommender, that first infers transition probabilities between items based on their similarities and models finite length random walks on the item space to compute predictions.Expand

The following problem is considered: Given an undirected, connected graph G, find a spanning tree in G such that the sum of the lengths of the fundamental cycles (with respect to this tree) is minimum.Expand

We present a new approach to the problem of finding communities: a community is a subset of actors who induce a locally optimal subgraph with respect to a density function defined on subsets of actors.Expand

A method for extracting alternating horizontal and vertical projection profiles are from nested sub-blocks of scanned page images of technical documents is discussed.Expand

A new induction principle based on a constructor model of a data structure is used to construct automatically an induction scheme suitable for proving inductive properties of functions defined on inductively constructed data structures.Expand

Abstract We introduce the concept of fault diameter of interconnection networks. The motivation is to estimate the degradation of performance under maximally fault conditions. We derive fault… Expand

This work identifies the limitations of n-way data analysis techniques in multidimensional stream data, such as Internet chat room communications data, and establishes a link between data collection and performance of these techniques.Expand

Boolean circuits of polynomial size and polylogarithmic depth are given for computing the Hermite and Smith normal forms of polynomial matrices over finite fields and the field of rational numbers.… Expand