5473 search results - page 842 / 1095 » On the graph isomorphism problem |
176
click to vote
EMMCVPR
2005
Springer
16 years 3 days ago
2005
Springer
We present a novel approach to the matching of subgraphs for object recognition in computer vision. Feature similarities between object model and scene graph are complemented with ...
192
click to vote
FCT
2005
Springer
16 years 14 hour ago
2005
Springer
We present several results on the complexity of various forms of Sperner’s Lemma in the black-box model of computing. We give a deterministic algorithm for Sperner problems over ...
169
click to vote
COMPGEOM
2004
ACM
16 years 5 min ago
2004
ACM
For a set S of points in Rd, an s-spanner is a graph on S such that any pair of points is connected via some path in the spanner whose total length is at most s times the Euclidea...
194
click to vote
MOBICOM
2004
ACM
15 years 12 months ago
2004
ACM
A newly deployed multi-hop radio network is unstructured and lacks a reliable and efficient communication scheme. In this paper, we take a step towards analyzing the problems exis...
159
click to vote
PLDI
2004
ACM
15 years 12 months ago
2004
ACM
Many program analyses can be reduced to graph reachability problems involving a limited form of context-free language reachability called Dyck-CFL reachability. We show a new redu...