485 search results - page 17 / 97 » Iterative Bounding LAO |
ISAAC
2005
Springer
15 years 3 months ago
2005
Springer
A partition of a set of n items is a grouping of the items into k disjoint classes of equal size. Any partition can be modeled as a graph: the items become the vertices of the grap...
COMPGEOM
2006
ACM
15 years 1 days ago
2006
ACM
We present upper and lower bounds for the number of iterations performed by the Iterative Closest Point (ICP) algorithm. This algorithm has been proposed by Besl and McKay [4] as ...
ALDT
2009
Springer
15 years 2 months ago
2009
Springer
Abstract. We study a model in which a group of agents make a sequence of collective decisions on whether to remain in the current state of the system or switch to an alternative st...
COMPGEOM
1993
ACM
15 years 2 months ago
1993
ACM
We give a practical and provably good Monte Carlo algorithm for approximating center points. Let P be a set of n points in IRd . A point c ∈ IRd is a β-center point of P if eve...
WCET
2003
14 years 11 months ago
2003
Worst-Case Execution Time (WCET) analysis means to compute a safe upper bound to the execution time of a piece of code. Parametric WCET analysis yields symbolic upper bounds: expr...