Zobrazeno 1 - 10
of 16
pro vyhledávání: '"Gideon Stupp"'
Publikováno v:
Information Processing Letters. 110:356-359
Let @m be a measure supported on a compact connected subset of an Euclidean space, which satisfies a uniform d-dimensional decay of the volume of balls of the type(1)@a@d^d=
Autor:
Moshe Sidi, Gideon Stupp
Publikováno v:
ALGOSENSORS
We consider three range-free localization protocols for sensor networks and analyze their accuracy in terms of the expected area of uncertainty of position per sensor. Assuming a small set of anchor nodes that know their position and broadcast it, we
Publikováno v:
Distributed Computing. 15:67-86
Long-lived and adaptive implementations of mutual exclusion and renaming in the read/write shared memory model are presented. An implementation of a task is adaptive if the step complexity of any operation in the implementation is a function of the n
Autor:
Gideon Stupp, Yehuda Afek
Publikováno v:
Journal of Algorithms. 25:95-117
Though it is common practice to treat synchronization primitives for multiprocessors as abstract data types, they are in reality machine instructions on registers. A crucial theoretical question with practical implications is the relationship between
Publikováno v:
PODC
Some of the first routing algorithms for position-aware wireless networks used the Delaunay triangulation of the point-locations of the network's nodes as the underlying connectivity graph. Later on these solutions were considered impractical because
Autor:
Gideon Stupp, Moshe Sidi
Publikováno v:
Algorithmic Aspects of Wireless Sensor Networks ISBN: 9783540224761
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::abf81545c5dac1daa7c6632cde021b64
https://doi.org/10.1007/978-3-540-27820-7_9
https://doi.org/10.1007/978-3-540-27820-7_9
We show that the alpha-weight of an MST over n points in a metric space with upper box dimension d has a bound independent of n if alpha is smaller than d and does not have one if alpha is larger than d.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d4c8bc4b0207d39f7cdcbbcaea5d8f16
http://arxiv.org/abs/math/0311481
http://arxiv.org/abs/math/0311481
Publikováno v:
FOCS
A distributed algorithm is adaptive if the worst case step complexity of its operations is bounded by a function of the number of processes that are concurrently active during the operation (rather than a function of N, the total number of processes,
Autor:
Gideon Stupp
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783540000730
DISC
DISC
The switches and routers of large scale networks cannot manage a state per user session. The burden of memory management would overwhelm the network. Therefore, it is important to find distributed network algorithms which hold a state only at the ini
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::35ce0939b6bf89bb7d30b68e9865eaee
https://doi.org/10.1007/3-540-36108-1_11
https://doi.org/10.1007/3-540-36108-1_11
Publikováno v:
PODC
Scopus-Elsevier
Scopus-Elsevier