Sciweavers

661 search results - page 87 / 133
» On Distributed Computation in Noisy Random Planar Networks
Sort
View
SIGMETRICS
2010
ACM
197views Hardware» more  SIGMETRICS 2010»
15 years 2 months ago
Coloring spatial point processes with applications to peer discovery in large wireless networks
In this paper, we study distributed channel assignment in wireless networks with applications to peer discovery in ad hoc wireless networks. We model channel assignment as a color...
Jian Ni, R. Srikant, Xinzhou Wu
PODC
1990
ACM
15 years 1 months ago
Sharing Memory Robustly in Message-Passing Systems
Emulators that translate algorithms from the shared-memory model to two different message-passing models are presented. Both are achieved by implementing a wait-free, atomic, singl...
Hagit Attiya, Amotz Bar-Noy, Danny Dolev
EUROPAR
2001
Springer
15 years 2 months ago
Optimal Many-to-One Routing on the Mesh with Constant Queues
We present randomized and deterministic algorithms for many-to-one routing on an n-node two-dimensional mesh under the store-and-forward model of packet routing. We consider the g...
Andrea Pietracaprina, Geppino Pucci
NETGAMES
2006
ACM
15 years 3 months ago
Comparing interest management algorithms for massively multiplayer games
Broadcasting all state changes to every player of a massively multiplayer game is not a viable solution. To successfully overcome the challenge of scale, massively multiplayer gam...
Jean-Sébastien Boulanger, Jörg Kienzle...
JMIV
2006
185views more  JMIV 2006»
14 years 9 months ago
Intrinsic Statistics on Riemannian Manifolds: Basic Tools for Geometric Measurements
In medical image analysis and high level computer vision, there is an intensive use of geometric features like orientations, lines, and geometric transformations ranging from simp...
Xavier Pennec