209 search results - page 27 / 42 » Reachability and the Power of Local Ordering |
ICDE
2011
IEEE
13 years 2 months ago
2011
IEEE
—In this demonstration paper, we present a powerful distributed framework for finding similar trajectories in a smartphone network, without disclosing the traces of participatin...
SODA
2008
ACM
14 years 8 days ago
2008
ACM
We show a tight lower bound of (N log log N) on the number of transmission required to compute the parity of N bits (with constant error) in a network of N randomly placed sensors...
ISPA
2004
Springer
14 years 4 months ago
2004
Springer
Abstract. Powerful grid and cluster computers allow efficient distributed simulation. Optimistic simulation techniques have been developed which allow for more parallelism in the l...
CSL
2008
Springer
14 years 19 days ago
2008
Springer
not use pointer arithmetic. Such "pure pointer algorithms" thus are a useful abstraction for studying the nature of logspace-computation. In this paper we introduce a for...
CISS
2010
IEEE
13 years 2 months ago
2010
IEEE
—This paper presents the system level performance evaluation for energy-detection based cooperative spectrum sensing in cognitive radio networks. Three performance criteria are q...