1016 search results - page 122 / 204 » Generalized distances between rankings |
128
click to vote
WWW
2005
ACM
16 years 1 months ago
2005
ACM
In the paper, we present an approach to mining a directed social network from a message board on the Internet where vertices denote individuals and directed links denote the flow ...
116
click to vote
RECOMB
2007
Springer
16 years 1 months ago
2007
Springer
Multi-break rearrangements break a genome into multiple fragments and further glue them together in a new order. While 2break rearrangements represent standard reversals, fusions, ...
104
click to vote
EPIA
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. In social network analysis, a k-clique is a relaxed clique, i.e., a kclique is a quasi-complete sub-graph. A k-clique in a graph is a sub-graph where the distance between...
141
click to vote
ICMCS
2008
IEEE
15 years 7 months ago
2008
IEEE
Image matching is a fundamental task of many problems in computer vision. This paper presents a novel local feature descriptor based on the gradient distance and orientation histo...
ICPR
2008
IEEE
15 years 7 months ago
2008
IEEE
Several validity indices have been designed to evaluate solutions obtained by clustering algorithms. Traditional indices are generally designed to evaluate center-based clustering...