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...
Williamson (2000a) has argued that positive introspection is incompatible with inexact knowledge. His argument relies on a margin-for-error requirement for inexact knowledge based...
Abstract. Renewed interest in ALOHA-based Medium Access Control (MAC) protocols stems from their proposed applications to wireless ad hoc and sensor networks that require distribut...
The general problem of answering top-k queries can be modeled using lists of data items sorted by their local scores. The most efficient algorithm proposed so far for answering to...
Anomaly detection systems largely depend on user profile data to be able to detect deviation from normal activity. Most of this profile data is based on commands executed by use...