Sciweavers

1528 search results - page 147 / 306
» On Signatures for Communication Graphs
Sort
View
HPDC
2010
IEEE
15 years 7 months ago
Mendel: efficiently verifying the lineage of data modified in multiple trust domains
Data is routinely created, disseminated, and processed in distributed systems that span multiple administrative domains. To maintain accountability while the data is transformed b...
Ashish Gehani, Minyoung Kim
INFOCOM
2009
IEEE
16 years 1 months ago
Lightweight Coloring and Desynchronization for Networks
—We study the distributed desynchronization problem for graphs with arbitrary topology. Motivated by the severe computational limitations of sensor networks, we present a randomi...
Arik Motskin, Tim Roughgarden, Primoz Skraba, Leon...
ICC
2007
IEEE
116views Communications» more  ICC 2007»
16 years 20 days ago
A Simple Iterative Gaussian Detector for Severely Delay-Spread MIMO Channels
— In this paper, a low-complexity high-performance detection algorithm for multiple input multiple output (MIMO) channels with severe delay spread is proposed. This algorithm per...
Tianbin Wo, Peter Adam Hoeher
CORR
2010
Springer
148views Education» more  CORR 2010»
15 years 6 months ago
Techniques for Enhanced Physical-Layer Security
Information-theoretic security--widely accepted as the strictest notion of security--relies on channel coding techniques that exploit the inherent randomness of propagation channel...
Pedro C. Pinto, João Barros, Moe Z. Win
NETWORKS
2010
15 years 4 months ago
Network flow spanners
Abstract. In this paper, motivated by applications of ordinary (distance) spanners in communication networks and to address such issues as bandwidth constraints on network links, l...
Feodor F. Dragan, Chenyu Yan