91 search results - page 11 / 19 » Using PageRank to Locally Partition a Graph |
BMCBI
2010
14 years 9 months ago
2010
Background: Extensive and automated data integration in bioinformatics facilitates the construction of large, complex biological networks. However, the challenge lies in the inter...
GECCO
2003
Springer
15 years 2 months ago
2003
Springer
Abstract. In this paper, we propose a hybrid genetic algorithm for partitioning a VLSI circuit graph into two disjoint graphs of minimum cut size. The algorithm includes a local op...
111
Voted
Publication
For quantitative analysis of histopathological images,
such as the lymphoma grading systems, quantification of
features is usually carried out on single cells before categorizing...
ICML
2007
IEEE
15 years 10 months ago
2007
IEEE
This paper investigates compression of 3D objects in computer graphics using manifold learning. Spectral compression uses the eigenvectors of the graph Laplacian of an object'...
93
Voted
ALMOB
2006
14 years 9 months ago
2006
Given a set S of n locally aligned sequences, it is a needed prerequisite to partition it into groups of very similar sequences to facilitate subsequent computations, such as the ...