814 search results - page 61 / 163 » Optimal pairings |
ISPA
2005
Springer
14 years 3 months ago
2005
Springer
In order to investigate the routing aspects of small-world networks, Kleinberg [13] proposes a network model based on a d-dimensional lattice with long-range links chosen at random...
SPAA
2003
ACM
14 years 3 months ago
2003
ACM
We consider an online version of the oblivious routing problem. Oblivious routing is the problem of picking a routing between each pair of nodes (or a set of ows), without knowled...
DKE
2006
13 years 10 months ago
2006
The K-Closest-Pairs Query (K-CPQ), a type of distance join in spatial databases, discovers the K pairs of objects formed from two different datasets with the K smallest distances....
CORR
2010
Springer
13 years 8 months ago
2010
Springer
— We consider perfect secret key generation for a “pairwise independent network” model in which every pair of terminals share a random binary string, with the strings shared ...
ICASSP
2011
IEEE
13 years 1 months ago
2011
IEEE
A simple geometric interpretation for received signal strength (RSS) difference based geolocation can be illustrated by considering a plane containing a single pair of receivers a...