374 search results - page 35 / 75 » On Communicating Automata with Bounded Channels |
151
click to vote
PODS
2004
ACM
16 years 6 months ago
2004
ACM
The important challenge of evaluating XPath queries over XML streams has sparked much interest in the past few years. A number of algorithms have been proposed, supporting wider f...
144
click to vote
GLOBECOM
2010
IEEE
15 years 4 months ago
2010
IEEE
Abstract--The information propagation speed (IPS) of a network specifies how fast the information can be transmitted in a network. In this paper, we derive an IPS upper bound in co...
168
click to vote
ESAS
2006
Springer
15 years 9 months ago
2006
Springer
Distance-bounding protocols aim to prevent an adversary from pretending that two parties are physically closer than they really are. We show that proposed distance-bounding protoco...
203
click to vote
ICC
2009
IEEE
15 years 3 months ago
2009
IEEE
During the last decade, many works were devoted to improving the performance of relaying techniques in ad hoc networks. One promising approach consists in allowing the relay nodes ...
152
click to vote
MOBICOM
2005
ACM
15 years 11 months ago
2005
ACM
— This paper studies how the capacity of a static multi-channel network scales as the number of nodes, n, increases. Gupta and Kumar have determined the capacity of single-channe...