2600 search results - page 100 / 520 » Clustering with or without the Approximation |
107
click to vote
ICC
2007
IEEE
15 years 7 months ago
2007
IEEE
—Slepian-Wolf coding is a promising distributed source coding technique that can completely remove the data redundancy caused by the spatially correlated observations in wireless...
106
click to vote
SSD
2005
Springer
15 years 7 months ago
2005
Springer
A moving cluster is defined by a set of objects that move close to each other for a long time interval. Real-life examples are a group of migrating animals, a convoy of cars movin...
124
click to vote
NIPS
2008
15 years 3 months ago
2008
Spectral clustering is useful for a wide-ranging set of applications in areas such as biological data analysis, image processing and data mining. However, the computational and/or...
149
click to vote
CGF
2010
14 years 10 months ago
2010
Mean shift is a popular approach for data clustering, however, the high computational complexity of the mean shift procedure limits its practical applications in high dimensional ...
103
click to vote
PODC
2006
ACM
15 years 7 months ago
2006
ACM
This paper presents a distributed algorithm for wireless adhoc networks that runs in polylogarithmic number of rounds in the size of the network and constructs a lightweight, line...