An algorithm, described by Sedgewick, finds the distance between the closest pair of n given points in a plane using a variant of mergesort. This takes O(n log n) time. To prove t...
This paper proposes a new approach for classifying text documents into two disjoint classes. The new approach is based on extracting patterns, in the form of two logical expressio...
The emergence of general audience digital libraries (GADLs) defines a context that represents a hybrid of both ``traditional'' IR, using primarily bibliographic resource...
Collaborative filtering systems predict a user's interest in new items based on the recommendations of other people with similar interests. Instead of performing content index...
Jonathan L. Herlocker, Joseph A. Konstan, John Rie...
Previous research in real-time concurrency control mainly focuses on the schedulability guarantee of hard real-time transactions and the reducing of the miss rate of soft real-tim...
Kam-yiu Lam, Tei-Wei Kuo, Ben Kao, Tony S. H. Lee,...