1477 search results - page 10 / 296 » On Graph Problems in a Semi-streaming Model |
66
Voted
ESA
2010
Springer
14 years 10 months ago
2010
Springer
Minor containment is a fundamental problem in Algorithmic Graph Theory, as numerous graph algorithms use it as a subroutine. A model of a graph H in a graph G is a set of disjoint ...
DAM
2007
14 years 9 months ago
2007
In hardware design, it is necessary to simulate the anticipated behavior of the integrated circuit before it is actually cast in silicon. As simulation procedures are long due to ...
CVPR
2007
IEEE
15 years 4 months ago
2007
IEEE
Energy-minimizing active contour models (snakes) have been proposed for solving many computer vision problems such as object segmentation, surface reconstruction, and object track...
ACCV
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. In this paper, we propose an efficient method for finding consistent correspondences between two sets of features. Our matching algorithm augments the discriminative pow...
113
click to vote
CP
2011
Springer
13 years 9 months ago
2011
Springer
The distance between two graphs is usually defined by means of the size of a largest common subgraph. This common subgraph may be an induced subgraph, obtained by removing nodes, ...