197 search results - page 10 / 40 » Robust Parallel Computations through Randomization |
AINA
2005
IEEE
15 years 3 months ago
2005
IEEE
The Location of nodes in sensor network is an important problem with application in resource allocation, location sensitive browsing, and emergency communications. A key problem i...
PODC
2009
ACM
15 years 2 months ago
2009
ACM
We present DRR-gossip, an energy-efficient and robust aggregate computation algorithm in wireless sensor networks. We prove that the DRR-gossip algorithm requires O(n) messages a...
CVPR
2011
IEEE
14 years 4 months ago
2011
IEEE
In this paper, we propose a novel framework to jointly recover the illumination environment and an estimate of the cast shadows in a scene from a single image, given coarse 3D geo...
SPAA
1992
ACM
15 years 1 months ago
1992
ACM
d abstract) Michael Kaufmann Sanguthevar Rajasekaran Jop F. Sibeyn In this paper we present randomized algorithms for kk routing, k-k sorting, and cut through routing on the mesh ...
100
click to vote
PPSN
2000
Springer
15 years 1 months ago
2000
Springer
Abstract. We explore a new general-purpose heuristic for nding highquality solutions to hard optimization problems. The method, called extremal optimization, is inspired by self-or...