1469 search results - page 270 / 294 » Approximate polynomial decomposition |
ICCV
2009
IEEE
14 years 7 months ago
2009
IEEE
We present a taxonomy for local distance functions where most existing algorithms can be regarded as approximations of the geodesic distance defined by a metric tensor. We categor...
ICTAI
2009
IEEE
14 years 7 months ago
2009
IEEE
We introduce TiMDPpoly, an algorithm designed to solve planning problems with durative actions, under probabilistic uncertainty, in a non-stationary, continuous-time context. Miss...
101
click to vote
JAIR
2010
14 years 4 months ago
2010
In many AI domains such as product configuration, a user should interactively specify a solution that must satisfy a set of constraints. In such scenarios, offline compilation of ...
JGO
2010
14 years 4 months ago
2010
The best known method to find exact or at least -approximate solutions to polynomial programming problems is the spatial Branch-and-Bound algorithm, which rests on computing lower...
SIAMADS
2010
14 years 4 months ago
2010
Precise spatiotemporal sequences of action potentials are observed in many brain areas and are thought to be involved in the neural processing of sensory stimuli. Here, we examine ...