736 search results - page 73 / 148 » Distinguishing geometric graphs |
169
click to vote
COMPGEOM
2010
ACM
15 years 11 months ago
2010
ACM
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...
152
click to vote
PAMI
2007
15 years 5 months ago
2007
—Over the past few decades, a large family of algorithms—supervised or unsupervised; stemming from statistics or geometry theory—has been designed to provide different soluti...
155
click to vote
ICIP
2002
IEEE
16 years 7 months ago
2002
IEEE
The encoding of shape information is a distinguishing feature of MPEG-4. In error prone communication networks, it is important and efficient to conceal shape errors spatially, so...
143
click to vote
ICPR
2006
IEEE
16 years 7 months ago
2006
IEEE
We present a novel split and merge based method for dividing a given metric map into distinct regions, thus effectively creating a topological map on top of a metric one. The init...
130
click to vote
ICRA
2007
IEEE
16 years 11 days ago
2007
IEEE
— In this paper, we propose a multi-level shadow identification scheme which is generally applicable without restrictions on the number of light sources, illumination conditions...