Given k sorted arrays, the t-Threshold problem, which is motivated by indexed search engines, consists of finding the elements which are present in at least t of the arrays. We pr...
E cient data-parallel spatial join algorithms for pmr quadtrees and R-trees, common spatial data structures, are presented. The domain consists of planar line segment data i.e., Bu...
This paper presents a computational framework that allows for a robust extraction of the extremal structure of scalar and vector fields on 2D manifolds embedded in 3D. This struct...
We propose a hybrid approach to coordinate structure analysis that combines a simple grammar to ensure consistent global structure of coordinations in a sentence, and features bas...
Abstract. A model of coevolutioinary genetic algorithms (COGA) consisting of two populations coevolving on two-bit landscapes is investigated in terms of the effects of random par...
Ming Chang, Kazuhiro Ohkura, Kanji Ueda, Masaharu ...