352 search results - page 34 / 71 » A local search approximation algorithm for k-means clusterin... |
GECCO
2007
Springer
15 years 3 months ago
2007
Springer
Dividing the set of nodes into clusters in the well-known traveling salesman problem results in the generalized traveling salesman problem which seeking a tour with minimum cost p...
GECCO
2008
Springer
14 years 10 months ago
2008
Springer
Pair approximations have often been used to predict equilibrium conditions in spatially-explicit epidemiological and ecological systems. In this work, we investigate whether this ...
168
click to vote
ICDE
2008
IEEE
15 years 11 months ago
2008
IEEE
Finding latent patterns in high dimensional data is an important research problem with numerous applications. Existing approaches can be summarized into 3 categories: feature selec...
ISMIS
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. A multi-relational clustering method is presented which can be applied to complex knowledge bases storing resources expressed in the standard Semantic Web languages. It a...
FGR
2006
IEEE
15 years 3 months ago
2006
IEEE
An unsupervised nonparametric approach is proposed to automatically extract representative face samples (exemplars) from a video sequence or an image set for multipleshot face rec...