187 search results - page 14 / 38 » Constrained 1-Spectral Clustering |
100
click to vote
EUROCAST
2009
Springer
15 years 6 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising in particular in network design. There exist various exact and metaheuri...
100
click to vote
GLOBECOM
2008
IEEE
15 years 6 months ago
2008
IEEE
—In this paper, we address the problem of establishing full connectivity and satisfying required traffic capacity between disconnected clusters in large wireless ad-hoc ground n...
108
click to vote
KDD
2005
ACM
16 years 3 days ago
2005
ACM
Graph clustering (also called graph partitioning) -- clustering the nodes of a graph -- is an important problem in diverse data mining applications. Traditional approaches involve...
ISBI
2008
IEEE
16 years 12 days ago
2008
IEEE
The cortical folding patterns are very different from one individual to another. Here we try to find folding patterns automatically using large-scale datasets by non-supervised cl...
ICASSP
2010
IEEE
14 years 12 months ago
2010
IEEE
Given a set of monophonic, harmonic sound sources (e.g. human voices or wind instruments), multi-pitch estimation (MPE) is the task of determining the instantaneous pitches of eac...