202 search results - page 19 / 41 » Locally identifying coloring of graphs |
126
click to vote
SIROCCO
2007
15 years 3 months ago
2007
We consider the problem of periodic exploration of all nodes in undirected graphs by using a nite state automaton called later a robot. The robot, using a constant number of state...
134
click to vote
CVPR
2010
IEEE
15 years 10 months ago
2010
IEEE
Interactive segmentation is useful for selecting objects of interest in images and continues to be a topic of much study. Methods that grow regions from foreground/background seed...
INFOCOM
2008
IEEE
15 years 8 months ago
2008
IEEE
Abstract—Efficient operation of wireless networks requires distributed routing and scheduling algorithms that take into account interference constraints. Recently, a few algorit...
120
click to vote
3DIM
2007
IEEE
15 years 8 months ago
2007
IEEE
In this paper, we present a new algorithm to reconstruct 3D surfaces from an unorganized point cloud based on generalizing the MPU implicit algorithm through introducing a powerfu...
ICCAD
1993
IEEE
15 years 5 months ago
1993
IEEE
In this paper, we look at the problem of inverter minimization in multi-level logic networks. The network is specified in terms of a set of base functions and the inversion opera...