—The performance of Particle Swarm Optimization (PSO) algorithms depends strongly upon the interaction among the particles. The existing communication topologies for PSO (e.g. st...
Abstract. In this paper we study the external memory planar point enclosure problem: Given N axis-parallel rectangles in the plane, construct a data structure on disk (an index) su...
We present a practical and general-purpose approach to large and complex visual data analysis where visualization processing, rendering and subsequent human interpretation is cons...
Kurt Stockinger, John Shalf, Kesheng Wu, E. Wes Be...
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...
The similarity join has become an important database primitive to support similarity search and data mining. A similarity join combines two sets of complex objects such that the r...