Sciweavers

7992 search results - page 281 / 1599
» Communication Abstractions for Distributed Systems
Sort
View
CORR
2007
Springer
117views Education» more  CORR 2007»
15 years 3 months ago
Perfectly Secure Steganography: Capacity, Error Exponents, and Code Constructions
An analysis of steganographic systems subject to the following perfect undetectability condition is presented in this paper. Following embedding of the message into the covertext,...
Ying Wang, Pierre Moulin
COCO
2010
Springer
153views Algorithms» more  COCO 2010»
15 years 7 months ago
Communication Complexity with Synchronized Clocks
Abstract—We consider two natural extensions of the communication complexity model that are inspired by distributed computing. In both models, two parties are equipped with synchr...
Russell Impagliazzo, Ryan Williams
120
Voted
CORR
2007
Springer
77views Education» more  CORR 2007»
15 years 3 months ago
Quantization Bounds on Grassmann Manifolds of Arbitrary Dimensions and MIMO Communications with Feedback
— This paper considers the quantization problem on the Grassmann manifold with dimension n and p. The unique contribution is the derivation of a closed-form formula for the volum...
Wei Dai, Youjian Liu, Brian Rider
115
Voted
COCO
2009
Springer
115views Algorithms» more  COCO 2009»
15 years 7 months ago
On the Communication Complexity of Read-Once AC^0 Formulae
Abstract--We study the 2-party randomized communication complexity of read-once AC0 formulae. For balanced AND-OR trees T with n inputs and depth d, we show that the communication ...
T. S. Jayram, Swastik Kopparty, Prasad Raghavendra
CMC
1998
Springer
15 years 7 months ago
The IntelliMedia WorkBench - An Environment for Building Multimodal Systems
Abstract. Intelligent MultiMedia (IntelliMedia) focuses on the computer processing and understanding of signal and symbol input from at least speech, text and visual images in term...
Tom Brøndsted, Paul Dalsgaard, Lars Bo Lars...