953 search results - page 43 / 191 » Using Clustering and Blade Clusters in the Terabyte Task |
EMNLP
2009
14 years 7 months ago
2009
The ambiguity of person names in the Web has become a new area of interest for NLP researchers. This challenging problem has been formulated as the task of clustering Web search r...
87
Voted
CCGRID
2010
IEEE
14 years 7 months ago
2010
IEEE
Due to the strong increase of processing units available to the end user, expressing parallelism of an algorithm is a major challenge for many researchers. Parallel applications ar...
129
click to vote
BMCBI
2011
14 years 1 months ago
2011
Background: Parallel T-Coffee (PTC) was the first parallel implementation of the T-Coffee multiple sequence alignment tool. It is based on MPI and RMA mechanisms. Its purpose is t...
CIDM
2007
IEEE
15 years 4 months ago
2007
IEEE
Clustering large data sets with high dimensionality is a challenging data-mining task. This paper presents a framework to perform such a task efficiently. It is based on the notio...
EUROPAR
1999
Springer
15 years 2 months ago
1999
Springer
This paper describes the realization of a parallel version of the k/h-means clustering algorithm. This is one of the basic algorithms used in a wide range of data mining tasks. We ...