1518 search results - page 101 / 304 » Exact and Approximate Bandwidth |
112
click to vote
ICRA
2010
IEEE
15 years 2 months ago
2010
IEEE
Abstract— Kinodynamic planning algorithms like RapidlyExploring Randomized Trees (RRTs) hold the promise of finding feasible trajectories for rich dynamical systems with complex...
130
click to vote
PSIVT
2009
Springer
15 years 9 months ago
2009
Springer
This article provides a simple and general way for defining the recovery rate of clustering algorithms using a given family of old clusters for evaluating the performance of the a...
115
click to vote
ATAL
2008
Springer
15 years 6 months ago
2008
Springer
In many complex multi-agent domains it is impractical to compute exact analytic solutions. An alternate means of analysis applies computational tools to derive and analyze empiric...
143
click to vote
UAI
2001
15 years 5 months ago
2001
We study the problem of projecting a distribution onto (or finding a maximum likelihood distribution among) Markov networks of bounded tree-width. By casting it as the combinatori...
118
click to vote
JAT
2006
15 years 4 months ago
2006
Recurrent bivariate fractal interpolation surfaces (RBFISs) generalise the notion of affine fractal interpolation surfaces (FISs) in that the iterated system of transformations us...