2004 search results - page 150 / 401 » Sampling from large graphs |
120
click to vote
ICRA
1999
IEEE
15 years 7 months ago
1999
IEEE
We consider the robot exploration of a planar graphlike world. The robot's goal is to build a complete map of its environment. The environment is modeled as an arbitrary undi...
157
click to vote
COCOON
2005
Springer
15 years 5 months ago
2005
Springer
The Maximum Common Subgraph (MCS) problem appears in many guises and in a wide variety of applications. The usual goal is to take as inputs two graphs, of order m and n, respectiv...
119
click to vote
CORR
2002
Springer
15 years 3 months ago
2002
Springer
We introduce a new approach for drawing diagrams. Our approach is to use a technique we call confluent drawing for visualizing non-planar graphs in a planar way. This approach all...
126
click to vote
ICCV
1998
IEEE
16 years 5 months ago
1998
IEEE
Proceedings of the 1998IEEE International Conference on Computer Vision, Bombay, India An algorithm to detect depth discontinuities from a stereo pair of images is presented. The ...
164
Voted
TIP
2011
14 years 10 months ago
2011
Abstract—The purpose of this study is to investigate multiregion graph cut image partitioning via kernel mapping of the image data. The image data is transformed implicitly by a ...