142 search results - page 20 / 29 » Filtering for Subgraph Isomorphism |
113
click to vote
SIGMOD
2010
ACM
15 years 7 months ago
2010
ACM
Mining graph patterns in large networks is critical to a variety of applications such as malware detection and biological module discovery. However, frequent subgraphs are often i...
125
click to vote
CVPR
2008
IEEE
16 years 4 months ago
2008
IEEE
Matching articulated shapes represented by voxel-sets reduces to maximal sub-graph isomorphism when each set is described by a weighted graph. Spectral graph theory can be used to...
146
click to vote
IWCIA
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. In this paper, we address the problem of computing a canonical representation of an n-dimensional combinatorial map. To do so, we define two combinatorial map signatures...
152
click to vote
AC
2000
Springer
15 years 6 months ago
2000
Springer
The management of large databases of hierarchical (e.g., multi-scale or multilevel) image features is a common problem in object recognition. Such structures are often represented ...
103
click to vote
JSYML
2008
15 years 2 months ago
2008
This article is devoted to two different generalizations of projective Boolean algebras: openly generated Boolean algebras and tightly -filtered Boolean algebras. We show that for ...