616 search results - page 69 / 124 » Minimum Spanning Tree Based Clustering Algorithms |
ALMOB
2006
13 years 7 months ago
2006
Background: The sparse connectivity of protein-protein interaction data sets makes identification of functional modules challenging. The purpose of this study is to critically eva...
EACL
1993
ACL Anthology
13 years 9 months ago
1993
ACL Anthology
This paper presents a method for parsing associative Lambek grammars based on graphtheoretic properties. Connection graphs, which are a simplified version of proof-nets, are actua...
WISE
2009
Springer
14 years 2 months ago
2009
Springer
Results clustering in Web Searching is useful for providing users with overviews of the results and thus allowing them to restrict their focus to the desired parts. However, the ta...
ICPR
2004
IEEE
14 years 8 months ago
2004
IEEE
We define a cluster to be characterized by regions of high density separated by regions that are sparse. By observing the downward closure property of density, the search for inte...
SODA
1992
ACM
13 years 8 months ago
1992
ACM
We present a general approximation technique for a large class of graph problems. Our technique mostly applies to problems of covering, at minimum cost, the vertices of a graph wit...