301 search results - page 28 / 61 » On Finding Dense Subgraphs |
CVPR
2004
IEEE
15 years 11 months ago
2004
IEEE
In this paper, we propose a novel linear programming based method to estimate arbitrary motion from two images. The proposed method always finds the global optimal solution of the...
BMCBI
2008
2008
Modifying the DPClus algorithm for identifying protein complexes based on new topological structures
14 years 9 months ago
Background: Identification of protein complexes is crucial for understanding principles of cellular organization and functions. As the size of protein-protein interaction set incr...
95
Voted
PPOPP
2006
ACM
15 years 3 months ago
2006
ACM
Performance analysis tools are critical for the effective use of large parallel computing resources, but existing tools have failed to address three problems that limit their scal...
TCS
2008
14 years 9 months ago
2008
We exemplify an optimization criterion for divide-and-conquer algorithms with a technique called generic competitive graph search. The technique is then applied to solve two probl...
83
Voted
CIDM
2007
IEEE
15 years 4 months ago
2007
IEEE
Clustering large data sets with high dimensionality is a challenging data-mining task. This paper presents a framework to perform such a task efficiently. It is based on the notio...