301 search results - page 25 / 61 » On Finding Dense Subgraphs |
DAGSTUHL
2008
14 years 11 months ago
2008
Abstract. A parallel version of the self-verified method for solving linear systems was presented in [19, 18]. In this research we propose improvements aiming at a better performan...
94
Voted
VMV
2008
14 years 11 months ago
2008
We propose a method to estimate dense motion vector fields from multi-exposure images. Our approach relies on finding a sparse set of correspondences between features in a single-...
ARSCOM
2008
14 years 9 months ago
2008
Let P(n, k) denote the number of graphs on n + k vertices that contain Pn, a path on n vertices, as an induced subgraph. In this note we will find upper and lower bounds for P(n, ...
79
Voted
IJCV
2000
14 years 9 months ago
2000
Abstract. We describe a novel automatic technique for finding a dense correspondence between a pair of n-dimensional surfaces with arbitrary topologies. This method employs a diffe...
74
Voted
ICPR
2002
IEEE
15 years 10 months ago
2002
IEEE
The graph is an essential data structure for representing relational information. When graphs are used to represent objects, comparing objects amounts to graph matching. Inexact g...