115 search results - page 1 / 23 » Watching Systems in graphs: an extension of Identifying Code... |
CORR
2010
Springer
13 years 2 months ago
2010
Springer
TIT
1998
13 years 5 months ago
1998
—We investigate a new class of codes for the optimal covering of vertices in an undirected graph Gsuch that any vertex in G can be uniquely identified by examining the vertices ...
ACSD
1998
IEEE
13 years 9 months ago
1998
IEEE
State coding conflict detection is a fundamental part of synthesis of asynchronous concurrent systems from their specifications as Signal Transition Graphs (STGs), which are a spe...
EJC
2008
13 years 3 months ago
2008
For a graph G and a set D V (G), define Nr[x] = {xi V (G) : d(x, xi) r} (where d(x, y) is graph theoretic distance) and Dr(x) = Nr[x] D. D is known as an r-identifying code if...
INTELLCOMM
2004
Springer
13 years 10 months ago
2004
Springer
We present the design, implementation and evaluation of a location detection system built over a Radio Frequency network based on the IEEE 802.11 standard. Our system employs beac...