The min-sum k-clustering problem is to partition a metric space (P, d) into k clusters C1, . . . , Ck ⊆ P such that k i=1 p,q∈Ci d(p, q) is minimized. We show the first effi...
Continuous logging of a person’s geographical position is required for various “life-log” applications, such as memory aids, automatic blog generation, and life pattern analy...
A visual simulator has been developed as an example of Web-based education tool, which is designed for students to understand graphically internal behavior and structure of comput...
We describe a general mechanism for adaptation in multiagent systems in which agents modify their behavior based on their memory of past events. These behavior changes can be elic...
Integrating processors and main memory is a promising approach to increase system performance. Such integration provides very high memory bandwidth that can be exploited efficientl...