We study the problem of adding k new links to a directed graph G(V, E) in order to maximize the minimum PageRank value for a given subset of the nodes. We show that this problem is...
We investigate a new, convex relaxation of an expectation-maximization (EM) variant that approximates a standard objective while eliminating local minima. First, a cautionary resu...
The computation of soft shadows created by area light sources is a well-known problem in computer graphics. Due to the complexity of the problem, soft shadows commonly are generat...
Various problems in machine learning, databases, and statistics involve pairwise distances among a set of objects. It is often desirable for these distances to satisfy the propert...
The construction of photo-realistic virtual worlds is at reach of current computer graphics. Unfortunately, the philosophy currently adopted for the diffusion of virtual worlds ov...