Sciweavers

597 search results - page 111 / 120
» Combinatorial Models for Cooperation Networks
Sort
View
IJNSEC
2007
144views more  IJNSEC 2007»
13 years 7 months ago
IPLess Stochastic Anonymous Routing Algorithm Using Multi-Agent Systems
The ability of communicating with a selected party anonymously is an important aspect of network security. Communicating anonymously means that no adversary can discern who is com...
Magdy Saeb, Meer Hamza, Ahmed El-Shikh
MTA
2007
183views more  MTA 2007»
13 years 7 months ago
The design of a wireless real-time visual surveillance system
In this paper, we study the important issues in the design of an efficient WIreless real-time visual SurveillancE System (WISES). Two important considerations are to minimize: (1)...
Kam-yiu Lam, Calvin K. H. Chiu
CSCW
2011
ACM
13 years 2 months ago
It's about time: confronting latency in the development of groupware systems
The presence of network latency leads to usability problems in distributed groupware applications. Example problems include difficulty synchronizing tightly-coupled collaboration...
Cheryl Savery, T. C. Nicholas Graham
EJC
2007
13 years 7 months ago
Deterministic random walks on the integers
Jim Propp’s P-machine, also known as the ‘rotor router model’ is a simple deterministic process that simulates a random walk on a graph. Instead of distributing chips to ran...
Joshua N. Cooper, Benjamin Doerr, Joel H. Spencer,...
TON
2002
125views more  TON 2002»
13 years 7 months ago
Multicast-based inference of network-internal delay distributions
Packet delay greatly influences the overall performance of network applications. It is therefore important to identify causes and location of delay performance degradation within ...
Francesco Lo Presti, Nick G. Duffield, Joseph Horo...