139 search results - page 6 / 28 » Reducibilities Relating to Schnorr Randomness |
102
click to vote
STACS
2001
Springer
15 years 6 months ago
2001
Springer
We study effectively given positive reals (more specifically, computably enumerable reals) under a measure of relative randomness introduced by Solovay [32] and studied by Calud...
101
Voted
INFOCOM
2007
IEEE
15 years 8 months ago
2007
IEEE
Abstract—In many networking applications such as file sharing, structured peer-to-peer networks are increasingly used in dynamic situations with fluctuating load, which require...
104
click to vote
JCSS
2010
15 years 7 days ago
2010
We present a simple randomized algorithmic framework for connected facility location problems. The basic idea is as follows: We run a black-box approximation algorithm for the unc...
132
click to vote
CVPR
2006
IEEE
16 years 3 months ago
2006
IEEE
This paper presents a generic method for solving Markov random fields (MRF) by formulating the problem of MAP estimation as 0-1 quadratic programming (QP). Though in general solvi...
125
click to vote
SODA
2008
ACM
15 years 3 months ago
2008
ACM
We present a simple randomized algorithmic framework for connected facility location problems. The basic idea is as follows: We run a black-box approximation algorithm for the unc...