2084 search results - page 403 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
INFOCOM
2010
IEEE
14 years 8 months ago
2010
IEEE
Abstract— Robustness and reliability are critical issues in network management. To provide resiliency, a popular protection scheme against network failures is the simultaneous ro...
PAMI
2011
14 years 4 months ago
2011
—We propose a convex formulation for silhouette and stereo fusion in 3D reconstruction from multiple images. The key idea is to show that the reconstruction problem can be cast a...
98
Voted
INFOCOM
2008
IEEE
15 years 4 months ago
2008
IEEE
—Rate allocation is a fundamental problem in the operation of a wireless network because of the necessity to schedule the operation of mutually interfering links between the node...
COMPGEOM
2010
ACM
15 years 2 months ago
2010
ACM
Let P be a set of n points in R3 . The 2-center problem for P is to find two congruent balls of the minimum radius whose union covers P. We present two randomized algorithms for ...
105
click to vote
CCS
2005
ACM
15 years 3 months ago
2005
ACM
Cyber attacks against networked computers have become relentless in recent years. The most common attack method is to exploit memory corruption vulnerabilities such as buffer ove...