Sciweavers

2569 search results - page 321 / 514
» Approximate Objects and Approximate Theories
Sort
View
COCOON
2008
Springer
15 years 8 months ago
The Computational Complexity of Link Building
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...
Martin Olsen
NIPS
2007
15 years 8 months ago
Convex Relaxations of Latent Variable Training
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...
Yuhong Guo, Dale Schuurmans
CGVR
2006
15 years 8 months ago
Real-time Computation of Area Shadows - A Geometrical Algorithm
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...
Michael Boehl, Wolfgang Stürzlinger
NIPS
2004
15 years 8 months ago
Triangle Fixing Algorithms for the Metric Nearness Problem
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...
Inderjit S. Dhillon, Suvrit Sra, Joel A. Tropp
VMV
2001
126views Visualization» more  VMV 2001»
15 years 8 months ago
Accessing Multi-user Virtual Worlds over IP
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...
Riccardo Bernardini, Guido M. Cortelazzo