1982 search results - page 33 / 397 » Designing Efficient Distributed Algorithms Using Sampling Te... |
69
Voted
CORR
2010
Springer
14 years 9 months ago
2010
Springer
In a sampling problem, we are given an input x {0, 1} n , and asked to sample approximately from a probability distribution Dx over poly (n)-bit strings. In a search problem, we ...
ISCC
2007
IEEE
15 years 3 months ago
2007
IEEE
This work presents the design of real-time applications for wireless sensor networks (WSNs) by using an algorithm based on data stream to process the sensor data. The proposed alg...
DATE
2010
IEEE
15 years 2 months ago
2010
IEEE
—We present a new technique for statistical static timing analysis (SSTA) based on Markov chain Monte Carlo (MCMC), that allows fast and accurate estimation of the right-hand tai...
ICCCN
2007
IEEE
15 years 3 months ago
2007
IEEE
In the past decade cluster computing platforms have been widely applied to support a variety of scientific and commercial applications, many of which are parallel in nature. Howev...
92
Voted
CORR
2010
Springer
14 years 9 months ago
2010
Springer
We investigate Monte Carlo Markov Chain (MCMC) procedures for the random sampling of some one-dimensional lattice paths with constraints, for various constraints. We will see that...