511 search results - page 39 / 103 » Lower bounds for distributed markov chain problems |
IANDC
2006
13 years 8 months ago
2006
Probabilistic verification of continuous-time stochastic processes has received increasing attention in the model-checking community in the past five years, with a clear focus on ...
PODS
2003
ACM
14 years 8 months ago
2003
ACM
Computing frequent itemsets and maximally frequent itemsets in a database are classic problems in data mining. The resource requirements of all extant algorithms for both problems...
TVLSI
2008
13 years 7 months ago
2008
We present a selective encoding method that reduces test data volume and test application time for scan testing of Intellectual Property (IP) cores. This method encodes the slices ...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
In a probabilistic cellular automaton (PCA), the cells are updated synchronously and independently, according to a distribution depending on a finite neighborhood. A PCA can be vi...
IJCV
2008
15 years 14 days ago
2008
In this paper, we propose a new stereo matching method using the population-based Markov Chain Monte Carlo (Pop-MCMC), which belongs to the sampling-based methods. Since the previo...