1261 search results - page 159 / 253 » Approximation algorithms for aligning points |
120
Voted
CCCG
2008
15 years 4 months ago
2008
We show that for any convex object Q in the plane, the average distance between the Fermat-Weber center of Q and the points in Q is at least 4(Q)/25, and at most 2(Q)/(3 3), wher...
133
Voted
NIPS
2004
15 years 4 months ago
2004
We present a novel method for learning with Gaussian process regression in a hierarchical Bayesian framework. In a first step, kernel matrices on a fixed set of input points are l...
176
Voted
DAM
2011
14 years 9 months ago
2011
We study various optimization problems in t-subtree graphs, the intersection graphs of tsubtrees, where a t-subtree is the union of t disjoint subtrees of some tree. This graph cl...
132
Voted
ICCS
2003
Springer
15 years 8 months ago
2003
Springer
The problem of computing the electrostatic energy of a large molecule is considered. It is reduced to solving the Poisson equation inside and the linear Poisson-Boltzmann equation ...
122
Voted
CGF
2008
15 years 2 months ago
2008
Authors' version: This paper presents a novel approach to obtain plausible soft shadows for complex dynamic scenes and a rectangular light source. We estimate the lights occl...