Viewpoint variance is one of the inevitable problems in vision based sign language recognition. However, most researchers avoid this problem by assuming a special view, especially...
In this paper, we propose a segmentation method based on the Generalized Fast Marching Method (GFMM) developed by Carlini et al.([6]). The classical Fast Marching Method (FMM) is a...
Nicolas Forcadel, Carole Le Guyader, Christian Gou...
We consider the computational problem of finding nearest neighbors in general metric spaces. Of particular interest are spaces that may not be conveniently embedded or approximate...
We study a wide generalization of two classical problems, the Huffman Tree and Alphabetic Tree Problem. We assume that the cost caused by the ith leaf is fi(di), where di is its d...
The purpose of this paper is to apply the scatter search methodology to general classes of binary problems. We focus on optimization problems for which the solutions are represent...