Sciweavers

356 search results - page 29 / 72
» Pairwise Cardinality Networks
Sort
View
NETWORKS
2002
13 years 7 months ago
Isomorphisms of the De Bruijn digraph and free-space optical networks
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 ...
David Coudert, Afonso Ferreira, Stephane Perennes
GLOBECOM
2010
IEEE
13 years 5 months ago
A Dynamic Framed ALOHA Scheme for Batch Resolution in Practical CSMA-Based Wireless Networks
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...
Andrea Zanella
DM
2007
83views more  DM 2007»
13 years 7 months ago
Codes identifying sets of vertices in random networks
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...
Alan M. Frieze, Ryan Martin, Julien Moncel, Mikl&o...
DCC
2004
IEEE
14 years 7 months ago
On the Complexity of Rate-Distortion Optimal Streaming of Packetized Media
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 ...
Martin Röder, Jean Cardinal, Raouf Hamzaoui
UAI
2001
13 years 9 months ago
Learning the Dimensionality of Hidden Variables
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...
Gal Elidan, Nir Friedman