1595 search results - page 67 / 319 » A hierarchical clustering algorithm based on the Hungarian m... |
153
click to vote
ICMLA
2008
15 years 7 months ago
2008
A method is presented to partition a given set of data entries embedded in Euclidean space by recursively bisecting clusters into smaller ones. The initial set is subdivided into ...
174
click to vote
SAC
2005
ACM
15 years 11 months ago
2005
ACM
Peer-to-peer (P2P) has become an important computing model because of its adaptation, self-organization and autonomy etc. But efficient organization of the nodes in P2P networks i...
123
click to vote
PODS
2005
ACM
16 years 6 months ago
2005
ACM
We present a divide-and-merge methodology for clustering a set of objects that combines a top-down "divide" phase with a bottom-up "merge" phase. In contrast, ...
195
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
In traditional framework of Compressive Sensing (CS), only sparse prior on the property of signals in time or frequency domain is adopted to guarantee the exact inverse recovery. ...
188
click to vote
ICASSP
2010
IEEE
15 years 6 months ago
2010
IEEE
In this paper, we examine the problem of learning from noisecontaminated data in high-dimensional space. A new learning approach based on projections onto multi-dimensional ellips...