421 search results - page 73 / 85 » String Distances and Uniformities |
IM
2008
13 years 8 months ago
2008
Let G = G(n, r) be a random geometric graph resulting from placing n nodes uniformly at random in the unit square (disk) and connecting every two nodes if and only if their Euclide...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
— This paper considers the quantization problem on the Grassmann manifold with dimension n and p. The unique contribution is the derivation of a closed-form formula for the volum...
SIAMAM
2008
13 years 8 months ago
2008
Abstract. We present a model of protein receptor trafficking within the membrane of a cylindrical dendrite containing small protrusions called spines. Spines are the locus of most ...
INFOCOM
2010
IEEE
13 years 7 months ago
2010
IEEE
—Beaconing is a primitive communication task in which every node locally broadcasts a packet to all its neighbors within a fixed distance. Assume that all communications proceed...
NETWORKS
2010
13 years 6 months ago
2010
The input to an Inverse Shortest Path Lengths Problem (ISPL) consists of a graph G with arc weights, and a collection of source-sink pairs with prescribed distances that do not ne...