523 search results - page 78 / 105 » Improved Approximation Algorithms for Maximum Graph Partitio... |
PVLDB
2010
13 years 7 months ago
2010
This paper introduces a new definition of dense subgraph pattern, the DN-graph. DN-graph considers both the size of the sub-structure and the minimum level of interactions betwee...
TCS
2008
13 years 8 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...
COCOON
2008
Springer
13 years 10 months ago
2008
Springer
We study the problem of adding k new links to a directed graph G(V, E) in order to maximize the minimum PageRank value for a given subset of the nodes. We show that this problem is...
CVPR
2012
IEEE
11 years 11 months ago
2012
IEEE
We propose an efficient algorithm to find the exact nearest neighbor based on the Euclidean distance for largescale computer vision problems. We embed data points nonlinearly on...
CVIU
2008
2008
Topology cuts: A novel min-cut/max-flow algorithm for topology preserving segmentation in N-D images
13 years 9 months ago
Topology is an important prior in many image segmentation tasks. In this paper, we design and implement a novel graph-based min-cut/max-flow algorithm that incorporates topology p...