This paper proposes a new method for comparing clusterings both partitionally and geometrically. Our approach is motivated by the following observation: the vast majority of previ...
Michael H. Coen, M. Hidayath Ansari, Nathanael Fil...
In many practical applications, it is useful to represent a function f(x) by its fuzzy transform, i.e., by the “average” values Fi = f(x) · Ai(x) dx Ai(x) dx over different ...
Current peer-to-peer (p2p) full-text keyword search techniques fall into the following categories: document-based partitioning, keyword-based partitioning, hybrid indexing, and se...
An octree is a recursive partition of the unit cube, such that in each step a cube is subdivided into eight smaller cubes. Those cubes that are not further subdivided are the leave...
In this paper, we present a method to estimate the number of reconfiguration steps that a time-constrained algorithm can accommodate. This analysis demonstrates how one would attac...