3096 search results - page 365 / 620 » The Generalized FITC Approximation |
175
click to vote
ISSAC
1995
Springer
15 years 10 months ago
1995
Springer
This paper introduces singular value decomposition (SVD) algorithms for some standard polynomial computations, in the case where the coefficients are inexact or imperfectly known....
160
click to vote
CIAC
2010
Springer
15 years 10 months ago
2010
Springer
A flow on a directed network is said to be confluent if the flow uses at most one outgoing arc at each node. Confluent flows arise naturally from destination-based routing. We stud...
154
click to vote
BMVC
2002
15 years 9 months ago
2002
In this paper, we construct a new class of deformable models using new biorthogonal wavelets, named Generalized Hermite Distributed Approximating Functional (g-HDAF) Wavelets. The...
156
click to vote
AAAI
2007
15 years 8 months ago
2007
Developing scalable coordination algorithms for multi-agent systems is a hard computational challenge. One useful approach, demonstrated by the Coverage Set Algorithm (CSA), explo...
167
click to vote
AAAI
2007
15 years 8 months ago
2007
We describe a point-based policy iteration (PBPI) algorithm for infinite-horizon POMDPs. PBPI replaces the exact policy improvement step of Hansen’s policy iteration with point...