2137 search results - page 143 / 428 » Experiments on Graph Clustering Algorithms |
82
Voted
ICIAP
1999
ACM
15 years 2 months ago
1999
ACM
In this paper a new learning algorithm is proposed with the purpose of texture segmentation. The algorithm is a competitive clustering scheme with two specific features: elliptic...
BMCBI
2008
14 years 10 months ago
2008
Background: Non-homology based methods such as phylogenetic profiles are effective for predicting functional relationships between proteins with no considerable sequence or struct...
WEA
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. In this paper we consider the problem of computing a minimum cycle basis of an undirected graph G = (V, E) with n vertices and m edges. We describe an efficient implement...
59
Voted
ICPR
2008
IEEE
15 years 4 months ago
2008
IEEE
Hua et al. have proposed a stable and efficient tracking algorithm called “K-means tracker”[2, 3, 5]. This paper describes an adaptive non-target cluster center selection met...
UAI
2008
14 years 11 months ago
2008
This paper presents a natural extension of stagewise ranking to the the case of infinitely many items. We introduce the infinite generalized Mallows model (IGM), describe its prop...