Traditional methods for frequent itemset mining typically assume that data is centralized and static. Such methods impose excessive communication overhead when data is distributed...
Matthew Eric Otey, Chao Wang, Srinivasan Parthasar...
In this paper, we propose an original solution for the general reverse k-nearest neighbor (RkNN) search problem. Compared to the limitations of existing methods for the RkNN searc...
Practical clustering algorithms require multiple data scans to achieve convergence. For large databases, these scans become prohibitively expensive. We present a scalable clusteri...
We introduce a persistentfunctional languagecalled PFL which adapts functional programming to the area of deductive databases,much as logic-based deductive databaselanguagesadapt ...
Task scheduling is an integrated component of computing. With the emergence of grid and ubiquitous computing, newer challenges have arisen in task scheduling. Unlike traditional p...