1729 search results - page 60 / 346 » Bound Graph Polysemy |
147
click to vote
TIT
2008
15 years 6 months ago
2008
For a linear code , the stopping redundancy of is defined as the minimum number of check nodes in a Tanner graph T for such that the size of the smallest stopping set in T is equal...
166
click to vote
INFOCOM
2009
IEEE
16 years 24 days ago
2009
IEEE
—Greedy routing is a novel routing paradigm where messages are always forwarded to the neighbor that is closest to the destination. Our main result is a polynomial-time algorithm...
173
click to vote
APVIS
2007
15 years 7 months ago
2007
A straight-line grid drawing of a planar graph G is a drawing of G on an integer grid such that each vertex is drawn as a grid point and each edge is drawn as a straight-line segm...
144
click to vote
CCCG
2004
15 years 7 months ago
2004
We propose a definition of locality for properties of geometric graphs. We measure the local density of graphs using region-counting distances [8] between pairs of vertices, and w...
146
click to vote
ICRA
2007
IEEE
16 years 14 days ago
2007
IEEE
Abstract— In this paper, we formalize the problem of barrier coverage, that is, the problem of preventing undetected intrusion in a particular region using robot sensors. We solv...