-- In this paper, an efficient approach to segment Persian off-line handwritten text-line into characters is presented. The proposed algorithm first traces the baseline of the inpu...
We study the shortest path problem in weighted polygonal subdivisions of the plane, with the additional constraint of an upper bound, k, on the number of links (segments) in the pa...
Ovidiu Daescu, Joseph S. B. Mitchell, Simeon C. Nt...
This paper presents adaptive weighting method for combining local classifiers by particle filter. In recent years, the effectiveness of combination of local classifiers (features)...
—A variety of clustering algorithms have recently been proposed to handle data that is not linearly separable; spectral clustering and kernel k-means are two of the main methods....
In this paper, we describe experiments into the application of term weighting techniques from text retrieval to support the automatic identification of significant locations from ...
Zhengwei Qiu, Cathal Gurrin, Aiden R. Doherty, Ala...