2260 search results - page 91 / 452 » A new algorithm for clustering search results |
177
click to vote
EUROCAST
2009
Springer
16 years 23 days 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...
170
click to vote
IPPS
2007
IEEE
16 years 15 days ago
2007
IEEE
Solving optimally large instances of combinatorial optimization problems requires a huge amount of computational resources. In this paper, we propose an adaptation of the parallel...
172
click to vote
EWIMT
2004
15 years 7 months ago
2004
The identification of categories in image databases usually relies on clustering algorithms that only exploit the feature-based similarities between images. The addition of semant...
177
click to vote
ASUNAM
2009
IEEE
15 years 11 months ago
2009
IEEE
In this paper we present an application of our incremental graph clustering algorithm (DENGRAPH) on a data set obtained from the music community site Last.fm. The aim of our study...
176
click to vote
NN
2002
Springer
15 years 5 months ago
2002
Springer
A new neural network architecture (PART) and the resulting algorithm are proposed to