Sciweavers

316 search results - page 37 / 64
» On the Space Complexity of Randomized Synchronization
Sort
View
SIROCCO
2008
14 years 11 months ago
Sharpness: A Tight Condition for Scalability
: A distributed system is scalable if the rate at which it completes its computation and communication tasks does not depend on its size. As an example, the scalability of a peer-t...
Augustin Chaintreau
TPDS
2010
89views more  TPDS 2010»
14 years 8 months ago
Energy-Efficient Protocol for Deterministic and Probabilistic Coverage in Sensor Networks
—Various sensor types, e.g., temperature, humidity, and acoustic, sense physical phenomena in different ways, and thus, are expected to have different sensing models. Even for th...
Mohamed Hefeeda, Hossein Ahmadi
ICASSP
2011
IEEE
14 years 1 months ago
Global emergent behaviors in clouds of agents
—Networks of biological agents (for example, ants, bees, fish, birds) and complex man-made cyberphysical infrastructures (for example, the power grid, transportation networks) e...
Soummya Kar, José M. F. Moura
CVPR
2007
IEEE
16 years 1 days ago
Cast Shadow Removal Combining Local and Global Features
In this paper, we present a method using pixel-level information, local region-level information and global-level information to remove shadow. At the pixel-level, we employ GMM t...
Zhou Liu, Kaiqi Huang, Tieniu Tan, Liangsheng Wang
ICALP
2005
Springer
15 years 3 months ago
Facility Location in Sublinear Time
Abstract. In this paper we present a randomized constant factor approximation algorithm for the problem of computing the optimal cost of the metric Minimum Facility Location proble...
Mihai Badoiu, Artur Czumaj, Piotr Indyk, Christian...