In this paper, we are concerned with the registration of two 3D data sets with large-scale
stretches and noises. First, by incorporating a scale factor into the standard iterative closest …

We show a worst-case lower bound and a smoothed upper bound on the number of
iterations performed by the iterative closest point (ICP) algorithm. First proposed by Besl and …

The majority of natural language processing (NLP) is English language processing, and
while there is good language technology support for (standard varieties of) English, support …

Cross-lingual word vector space alignment is the task of mapping the vocabularies of two
languages into a shared semantic space, which can be used for dictionary induction …

SLAM technology is increasingly used to self-locate mobile robots in an unknown
environment. One of the methods used in this technology is called scan matching …

We define b-compatibility for planar curves and propose three ball morphing techniques
between pairs of b-compatible curves. Ball-morphs use the automatic ball-map …

We define b-compatibility for planar curves and propose three ball morphing techniques (b-
morphs) between pairs of b-compatible curves. B-morphs use the automatic ball-map …

The problem of learning a correspondence relationship between nodes of two networks has
drawn much attention of the computer science community and recently that of statisticians …

The overlay of 2≤ m≤ d minimization diagrams of n surfaces in Rd is isomorphic to a
substructure of a suitably constructed minimization diagram of mn surfaces in R d+ m− 1 …

Given the start positions of a group of dancers, a choreographer specifies their end positions
and says:“Run!” Each dancer has the choice of his/her motion. These choices influence the …