354 search results - page 10 / 71 » Recovery Rate of Clustering Algorithms |
104
click to vote
EWSN
2007
Springer
15 years 11 months ago
2007
Springer
Many applications in wireless sensor networks (WSNs) benefit significantly from organizing nodes into groups, called clusters, because data aggregation and data filtering applied i...
ICASSP
2008
IEEE
15 years 6 months ago
2008
IEEE
In this paper, we examine the problem of overcomplete representations and provide new insights into the problem of stable recovery of sparse solutions in noisy environments. We es...
102
click to vote
CCGRID
2008
IEEE
14 years 11 months ago
2008
IEEE
In this paper, we describe the design and implementation of two mechanisms for fault-tolerance and recovery for complex scientific workflows on computational grids. We present our ...
107
click to vote
CVPR
2011
IEEE
14 years 3 months ago
2011
IEEE
We propose a new objective function for superpixel segmentation. This objective function consists of two components: entropy rate of a random walk on a graph and a balancing term....
ICPR
2008
IEEE
16 years 25 days ago
2008
IEEE
We present a new L1-distance-based k-means clustering algorithm to address the challenge of clustering high-dimensional proportional vectors. The new algorithm explicitly incorpor...