905 search results - page 142 / 181 » On the Complexity of uSPR Distance |
CN
2008
14 years 11 months ago
2008
In large peer-to-peer (P2P) overlay networks, nodes usually share resources to support all kinds of applications. In such networks, a subset of the nodes may assume the role of br...
104
click to vote
CORR
2010
Springer
14 years 11 months ago
2010
Springer
In this paper we show how the complexity of performing nearest neighbor (NNS) search on a metric space is related to the expansion of the metric space. Given a metric space we loo...
110
click to vote
CORR
2010
Springer
14 years 6 months ago
2010
Springer
Random linear network codes can be designed and implemented in a distributed manner, with low computational complexity. However, these codes are classically implemented [1] over fi...
107
click to vote
COMPGEOM
2011
ACM
14 years 2 months ago
2011
ACM
We consider the offset-deconstruction problem: Given a polygonal shape Q with n vertices, can it be expressed, up to a tolerance ε in Hausdorff distance, as the Minkowski sum o...
100
click to vote
INFOCOM
2010
IEEE
14 years 9 months ago
2010
IEEE
Abstract—We revisit the shortest path problem in asynchronous duty-cycled wireless sensor networks, which exhibit time-dependent features. We model the time-varying link cost and...