356 search results - page 29 / 72 » Pairwise Cardinality Networks |
NETWORKS
2002
14 years 11 months ago
2002
The de Bruijn digraph B(d, D) has degree d, diameter D, dD vertices and dD+1 arcs. It is usually defined by words of size D on an alphabet of cardinality d, through a cyclic left ...
GLOBECOM
2010
IEEE
14 years 9 months ago
2010
IEEE
Abstract--The batch resolution problem consists in arbitrating the channel access of a group of nodes in a wireless network in order to collect a single packet from each node in th...
DM
2007
14 years 11 months ago
2007
In this paper we deal with codes identifying sets of vertices in random networks; that is, (1, ≤ ℓ)-identifying codes. These codes enable us to detect sets of faulty processor...
106
click to vote
DCC
2004
IEEE
15 years 11 months ago
2004
IEEE
We consider the problem of rate-distortion optimal streaming of packetized media with sender-driven transmission over a single-QoS network using feedback and retransmissions. For ...
UAI
2001
15 years 1 months ago
2001
A serious problem in learning probabilistic models is the presence of hidden variables. These variables are not observed, yet interact with several of the observed variables. Dete...