Sciweavers

5183 search results - page 40 / 1037
» The Complexity of Distributions
Sort
View
INFOCOM
2002
IEEE
14 years 10 days ago
Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks
—Connected dominating set (CDS) has been proposed as virtual backbone or spine of wireless ad hoc networks. Three distributed approximation algorithms have been proposed in the l...
Peng-Jun Wan, Khaled M. Alzoubi, Ophir Frieder
ICCV
1999
IEEE
13 years 11 months ago
Illumination Distribution from Brightness in Shadows: Adaptive Estimation of Illumination Distribution with Unknown Reflectance
This paper describes a new method for estimating the illumination distribution of a real scene from a radiance distribution inside shadows cast by an object in the scene. First, t...
Imari Sato, Yoichi Sato, Katsushi Ikeuchi
WETICE
2006
IEEE
14 years 1 months ago
Modelling of Complex Supply Networks
In order to capture the increased complexity of products and production processes as well as market requirements, collaboration models representing organisational networks enable ...
Georg Weichhart, Christian Stary, Stefan Oppl
STOC
2005
ACM
101views Algorithms» more  STOC 2005»
14 years 29 days ago
The round complexity of two-party random selection
We study the round complexity of two-party protocols for generating a random nbit string such that the output is guaranteed to have bounded bias (according to some measure) even i...
Saurabh Sanghvi, Salil P. Vadhan
SPAA
2010
ACM
13 years 7 months ago
On the bit communication complexity of randomized rumor spreading
We study the communication complexity of rumor spreading in the random phone-call model. Suppose n players communicate in parallel rounds, where in each round every player calls a...
Pierre Fraigniaud, George Giakkoupis