Sciweavers

352 search results - page 6 / 71
» A local search approximation algorithm for k-means clusterin...
Sort
View
IPPS
2007
IEEE
15 years 3 months ago
Cluster-dot Screening by Local Exhaustive Search with Hardware Accelaration
Screening is an important task to convert a continuoustone image into a binary image with pure black and white pixels. The main contribution of this paper is to show a new algorit...
Yasuaki Ito, Koji Nakano
SDM
2012
SIAM
285views Data Mining» more  SDM 2012»
12 years 12 months ago
A Novel Approximation to Dynamic Time Warping allows Anytime Clustering of Massive Time Series Datasets
Given the ubiquity of time series data, the data mining community has spent significant time investigating the best time series similarity measure to use for various tasks and dom...
Qiang Zhu 0002, Gustavo E. A. P. A. Batista, Thana...
CORR
1999
Springer
222views Education» more  CORR 1999»
14 years 9 months ago
Analysis of approximate nearest neighbor searching with clustered point sets
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
Songrit Maneewongvatana, David M. Mount
BIBM
2009
IEEE
118views Bioinformatics» more  BIBM 2009»
15 years 1 months ago
Inexact Local Alignment Search over Suffix Arrays
We describe an algorithm for finding approximate seeds for DNA homology searches. In contrast to previous algorithms that use exact or spaced seeds, our approximate seeds may conta...
Mohammadreza Ghodsi, Mihai Pop
114
Voted
CIARP
2010
Springer
14 years 8 months ago
Improving the Dynamic Hierarchical Compact Clustering Algorithm by Using Feature Selection
Abstract. Feature selection has improved the performance of text clustering. In this paper, a local feature selection technique is incorporated in the dynamic hierarchical compact ...
Reynaldo Gil-García, Aurora Pons-Porrata