19 search results - page 3 / 4 » Iterated Nearest Neighbors and Finding Minimal Polytopes |
ICMCS
2006
IEEE
13 years 11 months ago
2006
IEEE
An algorithm for finding coupling points plays an important role in the Iterative Closest Point algorithm (ICP) which is widely used in registration applications in medical and 3-...
BMCBI
2008
13 years 5 months ago
2008
Background: Inference of evolutionary trees using the maximum likelihood principle is NP-hard. Therefore, all practical methods rely on heuristics. The topological transformations...
ICML
2005
IEEE
14 years 6 months ago
2005
IEEE
In this paper we describe a new method to reduce the complexity of support vector machines by reducing the number of necessary support vectors included in their solutions. The red...
PAMI
2006
13 years 5 months ago
2006
The k-means algorithm is widely used for clustering because of its computational efficiency. Given n points in d-dimensional space and the number of desired clusters k, k-means see...
CSB
2004
IEEE
13 years 9 months ago
2004
IEEE
Clustering is a common methodology for analyzing the gene expression data. In this paper, we present a new clustering algorithm from an information-theoretic point of view. First,...