Sciweavers

8298 search results - page 47 / 1660
» On the Complexity of Numerical Analysis
Sort
View
RTA
2010
Springer
15 years 10 months ago
Modular Complexity Analysis via Relative Complexity
Abstract. In this paper we introduce a modular framework which allows to infer (feasible) upper bounds on the (derivational) complexity of term rewrite systems by combining differ...
Harald Zankl, Martin Korp
149
Voted
IROS
2008
IEEE
113views Robotics» more  IROS 2008»
16 years 15 days ago
Motion planning for urban driving using RRT
— This paper provides a detailed analysis of the motion planning subsystem for the MIT DARPA Urban Challenge vehicle. The approach is based on the Rapidly-exploring Random Trees ...
Yoshiaki Kuwata, Gaston A. Fiore, Justin Teo, Emil...
ALENEX
2004
110views Algorithms» more  ALENEX 2004»
15 years 7 months ago
Computation of a Class of COntinued Fraction Constants
There are numerous instances where mathematical constants do not admit a closed form. It is then of great interest to compute them, possibly in an efficient way. So the question i...
Loïck Lhote
IBPRIA
2003
Springer
15 years 11 months ago
Segmentation of Curvilinear Objects Using a~Watershed-Based Curve Adjacency Graph
Abstract. This paper presents a general framework to segment curvilinear objects in 2D images. A pre-processing step relies on mathematical morphology to obtain a connected line wh...
Thierry Géraud
CPHYSICS
2007
89views more  CPHYSICS 2007»
15 years 6 months ago
Numerical differentiation of experimental data: local versus global methods
In the context of the analysis of measured data, one is often faced with the task to differentiate data numerically. Typically, this occurs when measured data are concerned or dat...
Karsten Ahnert, Markus Abel