2593 search results - page 380 / 519 » Algorithms and Data Structures for Computer Topology |
182
click to vote
ICANN
2009
Springer
15 years 11 months ago
2009
Springer
This paper proposes a clustering method SOMAK, which is composed by Self-Organizing Maps (SOM) followed by the Ant K-means (AK) algorithm. The aim of this method is not to find an...
218
click to vote
NIPS
2004
15 years 8 months ago
2004
We study a number of open issues in spectral clustering: (i) Selecting the appropriate scale of analysis, (ii) Handling multi-scale data, (iii) Clustering with irregular backgroun...
194
click to vote
SDM
2009
SIAM
16 years 4 months ago
2009
SIAM
Time series motifs are pairs of individual time series, or subsequences of a longer time series, which are very similar to each other. As with their discrete analogues in computat...
143
click to vote
ICML
2004
IEEE
16 years 7 months ago
2004
IEEE
A new class of nonparametric algorithms for high-dimensional binary classification is proposed using cascades of low dimensional polynomial structures. Construction of polynomial ...
160
click to vote
VMCAI
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. This paper addresses the problem of recovering variable-like entities when analyzing executables in the absence of debugging information. We show that variable-like entit...