Sciweavers

4276 search results - page 39 / 856
» Computability of Probability Distributions and Distribution ...
Sort
View
SPAA
1997
ACM
13 years 11 months ago
Accessing Nearby Copies of Replicated Objects in a Distributed Environment
Consider a set of shared objects in a distributed network, where several copies of each object may exist at any given time. To ensure both fast access to the objects as well as e ...
C. Greg Plaxton, Rajmohan Rajaraman, Andréa...
CLUSTER
2011
IEEE
12 years 7 months ago
A mobility-based cluster formation algorithm for wireless mobile ad-hoc networks
  In the last decade, numerous efforts have been devoted to design efficient algorithms for clustering the  wireless mobile ad‐hoc networks (MANET) consider...
Javad Akbari Torkestani, Mohammad Reza Meybodi
PODC
2010
ACM
13 years 11 months ago
Deterministic distributed vertex coloring in polylogarithmic time
Consider an n-vertex graph G = (V, E) of maximum degree ∆, and suppose that each vertex v ∈ V hosts a processor. The processors are allowed to communicate only with their neig...
Leonid Barenboim, Michael Elkin
IHI
2010
136views Healthcare» more  IHI 2010»
13 years 2 months ago
Modeling and estimating the spatial distribution of healthcare workers
This paper describes a spatial model for healthcare workers' location in a large hospital facility. Such models have many applications in healthcare, such as supporting timea...
Donald Ephraim Curtis, Christopher S. Hlady, Srira...
EUROCRYPT
1999
Springer
13 years 12 months ago
Distributed Pseudo-random Functions and KDCs
Abstract. This work describes schemes for distributing between n servers the evaluation of a function f which is an approximation to a random function, such that only authorized su...
Moni Naor, Benny Pinkas, Omer Reingold