Sciweavers

105 search results - page 9 / 21
» Why so many clustering algorithms: a position paper
Sort
View
BIBE
2008
IEEE
142views Bioinformatics» more  BIBE 2008»
15 years 4 months ago
Optimizing performance, cost, and sensitivity in pairwise sequence search on a cluster of PlayStations
— The Smith-Waterman algorithm is a dynamic programming method for determining optimal local alignments between nucleotide or protein sequences. However, it suffers from quadrati...
Ashwin M. Aji, Wu-chun Feng
ILP
2003
Springer
15 years 3 months ago
Disjunctive Learning with a Soft-Clustering Method
In the case of concept learning from positive and negative examples, it is rarely possible to find a unique discriminating conjunctive rule; in most cases, a disjunctive descripti...
Guillaume Cleuziou, Lionel Martin, Christel Vrain
ICCV
2007
IEEE
15 years 11 months ago
Unsupervised Joint Alignment of Complex Images
Many recognition algorithms depend on careful positioning of an object into a canonical pose, so the position of features relative to a fixed coordinate system can be examined. Cu...
Gary B. Huang, Vidit Jain, Erik G. Learned-Miller
JMM2
2006
212views more  JMM2 2006»
14 years 9 months ago
K-means Tracker: A General Algorithm for Tracking People
Abstract-- In this paper, we present a clustering-based tracking algorithm for tracking people (e.g. hand, head, eyeball, body, and lips). It is always a challenging task to track ...
Chunsheng Hua, Haiyuan Wu, Qian Chen, Toshikazu Wa...
EKAW
2004
Springer
15 years 3 months ago
A Hybrid Algorithm for Alignment of Concept Hierarchies
Hierarchical categorization is a powerful and convenient method so that it is commonly used in various areas, such as ontologies. Although each hierarchy is useful, there are probl...
Ryutaro Ichise, Masahiro Hamasaki, Hideaki Takeda