882 search results - page 91 / 177 » On the Hardness of Graph Isomorphism |
CCCG
2007
13 years 10 months ago
2007
In this paper, we consider the following graph embedding problem: Given a bipartite graph G = (V1, V2; E), where the maximum degree of vertices in V2 is 4, can G be embedded on a t...
IJSNET
2007
13 years 8 months ago
2007
: Robustness and security of services like localisation, routing and time synchronisation in Wireless Sensor Networks (WSNs) have been critical issues. Efficient mathematical (gra...
MM
2010
ACM
13 years 9 months ago
2010
ACM
Image classification is a well-studied and hard problem in computer vision. We extend a proven solution for classifying web spam to handle images. We exploit the link structure of...
PAMI
1998
13 years 8 months ago
1998
—This paper describes a new approach to matching geometric structure in 2D point-sets. The novel feature is to unify the tasks of estimating transformation geometry and identifyi...
CVIU
2011
13 years 9 days ago
2011
In this paper, we tackle the problem of embedding a set of relational structures into a metric space for purposes of matching and categorisation. To this end, we view the problem ...