Sciweavers

2735 search results - page 214 / 547
» Generalized Displacement Maps
Sort
View
TSMC
2008
84views more  TSMC 2008»
13 years 10 months ago
Learning Inverse Kinematics: Reduced Sampling Through Decomposition Into Virtual Robots
We propose a technique to speedup the learning of the inverse kinematics of a robot manipulator by decomposing it into two or more virtual robot arms. Unlike previous decomposition...
Vicente Ruiz de Angulo, Carme Torras
COMBINATORICS
2000
107views more  COMBINATORICS 2000»
13 years 10 months ago
Counting Pattern-free Set Partitions II: Noncrossing and Other Hypergraphs
A (multi)hypergraph H with vertices in N contains a permutation p = a1a2 . . . ak of 1, 2, . . . , k if one can reduce H by omitting vertices from the edges so that the resulting ...
Martin Klazar
GIS
1998
ACM
13 years 10 months ago
Road Collapse in Magnum
This paper describes the implementation of a triangulation based collapse algorithm in the general-purpose object oriented DBMS Magnum. The contribution of the paper is twofold. F...
Annita N. Wilschut, Roelof van Zwol, Jan Flokstra,...
NPL
2002
103views more  NPL 2002»
13 years 10 months ago
Kernel Nearest Neighbor Algorithm
The `kernel approach' has attracted great attention with the development of support vector machine (SVM) and has been studied in a general way. It offers an alternative soluti...
Kai Yu, Liang Ji, Xuegong Zhang
COLOGNETWENTE
2010
13 years 9 months ago
Complexity of O'Hara's Algorithm
In this paper we analyze O’Hara’s partition bijection. We present three type of results. First, we show that O’Hara’s bijection can be viewed geometrically as a certain sci...
Matjaz Konvalinka, Igor Pak