231 search results - page 13 / 47 » Sublinear time approximate clustering |
93
Voted
ICS
2010
Tsinghua U.
15 years 9 months ago
2010
Tsinghua U.
: We initiate the study of local, sublinear time algorithms for finding vertices with extreme topological properties -- such as high degree or clustering coefficient -- in large so...
91
Voted
CJ
2010
15 years 17 days ago
2010
A silent self-stabilizing asynchronous distributed algorithms is given for constructing a kdominating set, and hence a k-clustering, of a connected network of processes with uniqu...
102
click to vote
AAAI
2000
15 years 1 months ago
2000
We present a Bayesian clustering algorithm for multivariate time series. A clustering is regarded as a probabilistic model in which the unknown auto-correlation structure of a tim...
104
click to vote
ALGORITHMICA
2005
15 years 11 days ago
2005
Quorum systems are a mechanism for obtaining fault-tolerance and efficient distributed systems. We consider geographic quorum systems; a geographic quorum system is a partition of...
SODA
2012
ACM
13 years 2 months ago
2012
ACM
The following distributed coalescence protocol was introduced by Dahlia Malkhi in 2006 motivated by applications in social networking. Initially there are n agents wishing to coal...