352 search results - page 25 / 71 » A local search approximation algorithm for k-means clusterin... |
125
click to vote
DATESO
2007
15 years 2 months ago
2007
When searching databases of nucleotide or protein sequences, finding a local alignment of two sequences is one of the main tasks. Since the sizes of available databases grow const...
PR
2008
15 years 1 months ago
2008
Clustering in gene expression data sets is a challenging problem. Different algorithms for clustering of genes have been proposed. However due to the large number of genes only a ...
ICPR
2010
IEEE
14 years 11 months ago
2010
IEEE
A novel stochastic searching scheme based on the Monte Carlo optimization is presented for polygonal approximation (PA) problem. We propose to combine the split-and-merge based lo...
ICASSP
2011
IEEE
14 years 5 months ago
2011
IEEE
Bearings-only localization with light-of-sight (LOS) propagation is well understood. This paper concentrates on bearing-only localization with non-line-of-sight (NLOS) measurement...
127
click to vote
KDD
1997
ACM
15 years 4 months ago
1997
ACM
Discovery of association rules is an important problem in database mining. In this paper we present new algorithms for fast association mining, which scan the database only once, ...