5068 search results - page 809 / 1014 » Basic Computations in Wireless Networks |
125
click to vote
IPPS
1998
IEEE
15 years 8 months ago
1998
IEEE
Abstract. Finding paths in high-dimensional gemetric spaces is a provably hard problem. Recently, a general randomized planning scheme has emerged as an e ective approach to solve ...
128
click to vote
GI
2010
Springer
15 years 3 months ago
2010
Springer
Despite the ubiquity of barcodes there is no common product repository available today linking product master data to the corresponding barcodes. This paper proposes a social netwo...
146
click to vote
MOBIHOC
2008
ACM
16 years 4 months ago
2008
ACM
In order to better understand human and animal mobility and its potential effects on Mobile Ad-Hoc networks and Delay-Tolerant Networks, many researchers have conducted experiment...
123
click to vote
EUROCRYPT
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. Dining cryptographers networks (or DC-nets) are a privacypreserving primitive devised by Chaum for anonymous message publication. A very attractive feature of the basic D...
155
click to vote
MOBIHOC
2008
ACM
16 years 4 months ago
2008
ACM
Mobile opportunistic networks are characterized by unpredictable mobility, heterogeneity of contact rates and lack of global information. Successful delivery of messages at low co...