Previous research has addressed the scalability and availability issues associated with the construction of cluster-based network services. This paper studies the clustering of re...
Kai Shen, Tao Yang, Lingkun Chu, JoAnne Holliday, ...
d abstract) Gunter Rotey Christian Schwarzz Jack Snoeyinkx The width of a set of n points in the plane is the smallest distance between two parallel lines that enclose the set. W...
A user's profile, for the purpose of location management in a personal communication service (PCS) network, is formalized as a subgraph of the network graph. This subgraph, t...
The lazy caching algorithm of Afek, Brown, and Merrit (1993) is a protocol that allows the use of local caches with delayed updates. It results in a memory model that is not atomi...
Winner-Takes-All (WTA) prescriptions for Learning Vector Quantization (LVQ) are studied in the framework of a model situation: Two competing prototype vectors are updated accordin...