1059 search results - page 24 / 212 » Improved Algorithms via Approximations of Probability Distri... |
71
Voted
ICIAP
2007
ACM
15 years 9 months ago
2007
ACM
A recently proposed argument to explain the improved performance of the eight-point algorithm that results from using normalized data [IEEE Trans. Pattern Anal. Mach. Intell., 25(...
INFOCOM
2005
IEEE
15 years 3 months ago
2005
IEEE
— One of the key reasons overlay networks are seen as an excellent platform for large scale distributed systems is their resilience in the presence of node failures. This resilie...
SIGMETRICS
2006
ACM
15 years 3 months ago
2006
ACM
A major challenge in the design of wireless networks is the need for distributed scheduling algorithms that will efficiently share the common spectrum. Recently, a few distributed...
148
click to vote
DC
2011
13 years 9 months ago
2011
Abstract This paper gives poly-logarithmic-round, distributed δ-approximation algorithms for covering problems with submodular cost and monotone covering constraints (Submodular-c...
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
For Rayleigh/Rician statistics at the decision device, the probability of correct decision in the forced choice (FC) hypothesis test is given in terms of a closed-form finite ser...