Results 161 to 170 of about 10,452,469 (199)
Some of the next articles are maybe not open access.
Multimedia Communication in Wireless Environment
2006 12th International Multi-Media Modelling Conference, 2006Video delivery over wireless radio channel is the most difficult part in multimedia communication because of the vulnerability of a video bitstream encoded using a current video coding standard. Therefore it is necessary that a video bitstream needs to have some error resilient features.
openaire +2 more sources
A logic of communication in hostile environment
[1990] Proceedings. The Computer Security Foundations Workshop III, 2002The author adapts a knowledge-oriented model of distributed systems in order to analyze cryptographic protocols. This new model provides semantics for a logic of knowledge, time and communication. He expresses and proves with this logic security properties as secrecy and authentication. >
openaire +1 more source
Changing Communication Environments in MosquitoNet
1994 First Workshop on Mobile Computing Systems and Applications, 1994MosquitoNet is a new project at Stanford University for investigating operating system and application issues in mobile and wireless computing. Our initial goals focus on providing the appearance of continuous network connectivity for mobile hosts. To achieve these goals we must first enable portable computers to move seamlessly from one communications
openaire +2 more sources
Communication Sciences in a University Environment
IBM Journal of Research and Development, 1958Information processes and information processing systems are the principal concerns of investigators in many fields, including electrical engineering, neurophysiology, psychology, linguistics, genetics and mathematics. Studies in each of these fields contribute to understanding in the others, and each has a need for mathematical models and mathematical
openaire +2 more sources
Gossiping in the multicasting communication environment
Proceedings 15th International Parallel and Distributed Processing Symposium. IPDPS 2001, 2002The gossiping problem consists of an n processor communication network N, in which every processor has to broadcast a single message. We present an efficient algorithm to generate a communication schedule with total communication time at most n+r, where r is the radius of the network, when message multicasting is allowed.
openaire +1 more source
Environment and Communication: A Review
British Journal of Special Education, 1981openaire +2 more sources