1319 search results - page 101 / 264 » Recursive Random Fields |
119
Voted
FOCS
2000
IEEE
15 years 5 months ago
2000
IEEE
Extractors (defined by Nisan and Zuckerman) are procedures that use a small number of truly random bits (called the seed) to extract many (almost) truly random bits from arbitrar...
117
click to vote
EMMCVPR
2007
Springer
15 years 7 months ago
2007
Springer
: We presented and evaluated a new Bayesian method for range image segmentation. The method proceeds in to stages. First, an initial segmentation was produced by a randomized regio...
108
Voted
STOC
2007
ACM
16 years 1 months ago
2007
ACM
In 1998, Impagliazzo and Wigderson [IW98] proved a hardness vs. randomness tradeoff for BPP in the uniform setting, which was subsequently extended to give optimal tradeoffs for t...
101
Voted
ICN
2005
Springer
15 years 6 months ago
2005
Springer
Spatially coordinated packet sampling can be implemented by using a deterministic function of packet content to determine the selection decision for a given packet. In this way, a...
127
click to vote
FOCS
1999
IEEE
15 years 5 months ago
1999
IEEE
Various efforts ([?, ?, ?]) have been made in recent years to derandomize probabilistic algorithms using the complexity theoretic assumption that there exists a problem in E = dti...