1612 search results - page 114 / 323 » Analysing Randomized Distributed Algorithms |
133
Voted
PODC
2010
ACM
15 years 6 months ago
2010
ACM
Consider an n-vertex graph G = (V, E) of maximum degree ∆, and suppose that each vertex v ∈ V hosts a processor. The processors are allowed to communicate only with their neig...
109
Voted
PKDD
2004
Springer
15 years 7 months ago
2004
Springer
Clustering has become an increasingly important task in analysing huge amounts of data. Traditional applications require that all data has to be located at the site where it is scr...
128
Voted
ICIP
2006
IEEE
16 years 4 months ago
2006
IEEE
Recently, new sampling schemes were presented for signals with finite rate of innovation (FRI) using sampling kernels reproducing polynomials or exponentials [1] [2]. In this pape...
126
Voted
SSPR
1998
Springer
15 years 6 months ago
1998
Springer
: We present a practical approach to nonparametric cluster analysis of large data sets. The number of clusters and the cluster centres are automatically derived by mode seeking wit...
143
Voted
COMCOM
2011
14 years 9 months ago
2011
This paper presents a rigorous analytic study of gossip-based message dissemination schemes that can be employed for content/service dissemination or discovery in unstructured and...