Sciweavers

159 search results - page 12 / 32
» Codes identifying sets of vertices in random networks
Sort
View
CORR
2006
Springer
102views Education» more  CORR 2006»
13 years 7 months ago
Structural Inference of Hierarchies in Networks
One property of networks that has received comparatively little attention is hierarchy, i.e., the property of having vertices that cluster together in groups, which then join to f...
Aaron Clauset, Cristopher Moore, M. E. J. Newman
CORR
2010
Springer
105views Education» more  CORR 2010»
13 years 2 months ago
Universal and Robust Distributed Network Codes
Random linear network codes can be designed and implemented in a distributed manner, with low computational complexity. However, these codes are classically implemented [1] over fi...
Tracey Ho, Sidharth Jaggi, Svitlana Vyetrenko, Lin...
GLOBECOM
2007
IEEE
14 years 1 months ago
Cooperative Space-Time Coded Transmissions in Nakagami-m Fading Channels
— In this paper we evaluate outage performance of a cooperative transmission protocol over fading channels that requires a number of relaying nodes to employ a distributed space-...
Stefano Savazzi, Umberto Spagnolini
TCSV
2002
132views more  TCSV 2002»
13 years 7 months ago
A study of real-time packet video quality using random neural networks
An important and unsolved problem today is the automatic quantification of the quality of video flows transmitted over packet networks. In particular, the ability to perform this ...
Samir Mohamed, Gerardo Rubino
DSN
2005
IEEE
14 years 1 months ago
Coverage and the Use of Cyclic Redundancy Codes in Ultra-Dependable Systems
A Cyclic Redundancy Code (CRC), when used properly, can be an effective and relatively inexpensive method to detect data corruption across communication channels. However, some sy...
Michael Paulitsch, Jennifer Morris, Brendan Hall, ...