Sciweavers

652 search results - page 34 / 131
» Accelerated EM-based clustering of large data sets
Sort
View
CIARP
2004
Springer
14 years 1 months ago
Parallel Algorithm for Extended Star Clustering
In this paper we present a new parallel clustering algorithm based on the extended star clustering method. This algorithm can be used for example to cluster massive data sets of do...
Reynaldo Gil-García, José Manuel Bad...
ASPLOS
2012
ACM
12 years 3 months ago
A case for unlimited watchpoints
Numerous tools have been proposed to help developers fix software errors and inefficiencies. Widely-used techniques such as memory checking suffer from overheads that limit thei...
Joseph L. Greathouse, Hongyi Xin, Yixin Luo, Todd ...
WSDM
2012
ACM
329views Data Mining» more  WSDM 2012»
12 years 3 months ago
Beyond 100 million entities: large-scale blocking-based resolution for heterogeneous data
A prerequisite for leveraging the vast amount of data available on the Web is Entity Resolution, i.e., the process of identifying and linking data that describe the same real-worl...
George Papadakis, Ekaterini Ioannou, Claudia Niede...
BMCBI
2008
211views more  BMCBI 2008»
13 years 8 months ago
CUDA compatible GPU cards as efficient hardware accelerators for Smith-Waterman sequence alignment
Background: Searching for similarities in protein and DNA databases has become a routine procedure in Molecular Biology. The Smith-Waterman algorithm has been available for more t...
Svetlin Manavski, Giorgio Valle
AAAI
2006
13 years 9 months ago
When Is Constrained Clustering Beneficial, and Why?
Several researchers have illustrated that constraints can improve the results of a variety of clustering algorithms. However, there can be a large variation in this improvement, e...
Kiri Wagstaff, Sugato Basu, Ian Davidson