2228 search results - page 329 / 446 » Distributed Data Clustering Can Be Efficient and Exact |
STOC
2002
ACM
14 years 10 months ago
2002
ACM
A locality sensitive hashing scheme is a distribution on a family F of hash functions operating on a collection of objects, such that for two objects x, y, PrhF [h(x) = h(y)] = si...
MOBIHOC
2001
ACM
14 years 10 months ago
2001
ACM
We propose a new routing graph, the Restricted Delaunay Graph (RDG), for ad hoc networks. Combined with a node clustering algorithm, RDG can be used as an underlying graph for geo...
CCGRID
2006
IEEE
14 years 4 months ago
2006
IEEE
—A Web services-based publish/subscribe system has the potential to create an Internet scale interoperable event notification system which is important for Grid computing as it e...
UAI
1990
13 years 11 months ago
1990
The intelligent reformulation or restructuring of a belief network can greatly increase the efficiency of inference. However, time expended for reformulation is not available for ...
ICPP
1999
IEEE
14 years 2 months ago
1999
IEEE
This paper describes transformation techniques for out-of-core programs (i.e., those that deal with very large quantities of data) based on exploiting locality using a combination...