5215 search results - page 649 / 1043 » Quantum clustering algorithms |
193
click to vote
PVM
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. Today’s large finite element simulations require parallel algorithms to scale on clusters with thousands or tens of thousands of processor cores. We present data struc...
364
click to vote
GECCO
2011
Springer
14 years 10 months ago
2011
Springer
The generalized traveling salesman problem (GTSP) is an NPhard problem that extends the classical traveling salesman problem by partitioning the nodes into clusters and looking fo...
165
click to vote
ICCV
1999
IEEE
16 years 8 months ago
1999
IEEE
Automatic grouping and segmentation of images remains a challenging problem in computer vision. Recently, a number of authors have demonstrated good performance on this task using...
169
click to vote
KDD
2007
ACM
16 years 7 months ago
2007
ACM
Time series motifs are approximately repeated patterns found within the data. Such motifs have utility for many data mining algorithms, including rule-discovery, novelty-detection...
187
click to vote
KDD
2007
ACM
16 years 7 months ago
2007
ACM
Given its importance, the problem of predicting rare classes in large-scale multi-labeled data sets has attracted great attentions in the literature. However, the rare-class probl...