5473 search results - page 654 / 1095 » On the graph isomorphism problem |
138
click to vote
GI
2007
Springer
16 years 1 months ago
2007
Springer
: Several algorithms are common for estimating depth from stereo series, but many of them have difficulties when determining depth of objects having periodical structure. This con...
167
click to vote
ICALP
2007
Springer
16 years 1 months ago
2007
Springer
This paper studies labeling schemes for the vertex connectivity function on general graphs. We consider the problem of labeling the nodes of any n-node graph is such a way that gi...
148
click to vote
ICALP
2007
Springer
16 years 1 months ago
2007
Springer
Exploring a graph through search is one of the most basic building blocks of various applications. In a setting with a huge state space, such as in testing and verification, optim...
171
click to vote
ISI
2007
Springer
16 years 1 months ago
2007
Springer
—We address the problem of planning patrol routes to maximize coverage of important locations (hot spots) at minimum cost (length of patrol route). We model a road network using ...
155
click to vote
DIAL
2006
IEEE
16 years 27 days ago
2006
IEEE
It is an important topic for segmentation on how to merge the over-segmented subimages of characters into integral characters. The conventional character segmentation has been mos...