Sciweavers

182 search results - page 17 / 37
» Survey on anonymous communications in computer networks
Sort
View
GPC
2008
Springer
14 years 10 months ago
Write Once, Run Anywhere - A Survey of Mobile Runtime Environments
The hype surrounding Web 2.0 and technologies such as AJAX shows: The future of distributed application development lies in Rich Internet Applications (RIAs), which are based on h...
Sören Blom, Matthias Book, Volker Gruhn, Rusl...
JCS
2011
126views more  JCS 2011»
14 years 4 months ago
Authentication protocols based on low-bandwidth unspoofable channels: A comparative survey
One of the main challenges in pervasive computing is how we can establish secure communication over an untrusted high-bandwidth network without any initial knowledge or a Public K...
L. H. Nguyen, A. W. Roscoe
STACS
2005
Springer
15 years 3 months ago
Exact Quantum Algorithms for the Leader Election Problem
Abstract. It is well-known that no classical algorithm can solve exactly (i.e., in bounded time without error) the leader election problem in anonymous networks. This paper propose...
Seiichiro Tani, Hirotada Kobayashi, Keiji Matsumot...
CCR
2010
196views more  CCR 2010»
14 years 7 months ago
OFDMA in the field: current and future challenges
OFDMA will be the predominant technology for the air interface of broadband mobile wireless systems for the next decades. In recent years, OFDMA-based networks based on IEEE 802.1...
Andreas Maeder, Nader Zein
CDC
2008
IEEE
149views Control Systems» more  CDC 2008»
14 years 11 months ago
Distributed computation under bit constraints
Abstract-- A network of nodes communicate via noisy channels. Each node has some real-valued initial measurement or message. The goal of each of the nodes is to acquire an estimate...
Ola Ayaso, Devavrat Shah, Munther A. Dahleh