2722 search results - page 97 / 545 » Hastily formed networks |
EJC
2008
13 years 8 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...
PVLDB
2010
13 years 8 months ago
2010
With the emergence of new applications, e.g., computational biology, new software engineering techniques, social networks, etc., more data is in the form of graphs. Locating occur...
CN
2010
13 years 8 months ago
2010
Technological evolution is leading telecommunications to all-IP networks where multiple services are transported as IP packets. Among these are the group communications services w...
IPPS
2010
IEEE
13 years 8 months ago
2010
IEEE
We develop a widely applicable algorithm to solve the fault diagnosis problem in certain distributed-memory multiprocessor systems in which there are a limited number of faulty pr...
DAIS
2009
13 years 8 months ago
2009
Queries are widely used for acquiring data distributed in opportunistically formed mobile networks. However, when queries are executed in such dynamic settings, the returned result...