232 search results - page 8 / 47 » Dynamic Graph Clustering Using Minimum-Cut Trees |
127
click to vote
PR
2008
15 years 2 months ago
2008
The spectrum of a graph has been widely used in graph theory to characterise the properties of a graph and extract information from its structure. It has also been employed as a g...
118
click to vote
ISAAC
2007
Springer
15 years 8 months ago
2007
Springer
The problem of maintaining a representation of a dynamic graph as long as a certain property is satisfied has recently been considered for a number of properties. This paper prese...
148
Voted
CVPR
2011
IEEE
14 years 10 months ago
2011
IEEE
We propose a novel linearly augmented tree method for efficient scale and rotation invariant object matching. The proposed method enforces pairwise matching consistency defined ...
131
Voted
IBPRIA
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. This paper presents a new approach to the problem of simultaneous location and segmentation of object in images. The main emphasis is done on the information provided by ...
109
click to vote
ECCV
1998
Springer
16 years 4 months ago
1998
Springer
?It is well-known that the problem of matching two relational structures can be posed as an equivalent problem of finding a maximal clique in a (derived) ?association graph.? Howev...