1439 search results - page 208 / 288 » Fast approximation of centrality |
IJRR
2008
13 years 10 months ago
2008
The motion-planning problem, involving the computation of a collision-free path for a moving entity amidst obstacles, is a central problem in fields like Robotics and Game Design....
MP
2008
13 years 10 months ago
2008
: We present polynomial-time interior-point algorithms for solving the Fisher and Arrow-Debreu competitive market equilibrium problems with linear utilities and n players. Both of ...
NECO
2008
13 years 10 months ago
2008
While evidence indicates that neural systems may be employing sparse approximations to represent sensed stimuli, the mechanisms underlying this ability are not understood. We desc...
CAGD
2005
13 years 10 months ago
2005
A simple algorithm for surface interpolation is proposed. Its central idea is quadratic interpolation of a curved segment from the position and normal vectors at the end points, w...
VC
2008
13 years 10 months ago
2008
It is difficult to render caustic patterns at interactive frame rates. This paper introduces new rendering techniques that relax current constraints, allowing scenes with moving, n...