Sciweavers

23 search results - page 4 / 5
» dagstuhl 2000
Sort
View
DAGSTUHL
2000
13 years 6 months ago
Algorithm Engineering for Parallel Computation
The emerging discipline of algorithm engineering has primarily focussed on transforming pencil-and-paper sequential algorithms into robust, efficient, well tested, and easily used ...
David A. Bader, Bernard M. E. Moret, Peter Sanders
DAGSTUHL
2000
13 years 6 months ago
Vision and Touch for Grasping
This paper introduces our one-armed stationary humanoid robot GripSee together with research projects carried out on this platform. The major goal is to have it analyze a table sce...
Rolf P. Würtz
DAGSTUHL
2000
13 years 6 months ago
Similarity Measure Computation of Convex Polyhedra Revisited
We study the computation of rotation-invariant similarity measures of convex polyhedra, based on Minkowski's theory of mixed volumes. To compute the similarity measure, a (mix...
Jos B. T. M. Roerdink, Henk Bekker
DAGSTUHL
2003
13 years 6 months ago
Numerical Irreducible Decomposition Using PHCpack
Homotopy continuation methods have proven to be reliable and efficient to approximate all isolated solutions of polynomial systems. In this paper we show how we can use this capabi...
Andrew J. Sommese, Jan Verschelde, Charles W. Wamp...
DAGSTUHL
2007
13 years 6 months ago
Convergence of iterative aggregation/disaggregation methods based on splittings with cyclic iteration matrices
Iterative aggregation/disaggregation methods (IAD) belong to competitive tools for computation the characteristics of Markov chains as shown in some publications devoted to testing...
Ivo Marek, Ivana Pultarová, Petr Mayer