Parallel probabilistic searching and sorting algorithms
Ivan Kramosil (1990)
Kybernetika
Similarity:
Ivan Kramosil (1990)
Kybernetika
Similarity:
Dixon, John D. (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Kirschenhofer, Peter (1994)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
Dorin Bocu (2000)
The Yugoslav Journal of Operations Research
Similarity:
Heiko Goeman, Michael Clausen (2002)
Kybernetika
Similarity:
This paper deals with a new practical method for solving the longest common subsequence (LCS) problem. Given two strings of lengths and , , on an alphabet of size , we first present an algorithm which determines the length of an LCS in time and space. This result has been achieved before [ric94,ric95], but our algorithm is significantly faster than previous methods. We also provide a second algorithm which generates an LCS in time while preserving the linear space bound,...
Holmes, Petra E., Linton, Stephen A., Murray, Scott H. (2003)
Experimental Mathematics
Similarity:
Nenad Mladenović, José A. Moreno, J. Marcos Moreno-Vega (1996)
The Yugoslav Journal of Operations Research
Similarity:
Fill, James Allen, Huber, Mark L. (2010)
Electronic Journal of Probability [electronic only]
Similarity:
Hans C. Andersen, Persi Diaconis (2007)
Journal de la société française de statistique
Similarity:
We present a generalization of hit and run algorithms for Markov chain Monte Carlo problems that is ‘equivalent’ to data augmentation and auxiliary variables. These algorithms contain the Gibbs sampler and Swendsen-Wang block spin dynamics as special cases. The unification allows theorems, examples, and heuristics developed in one domain to illuminate parallel domains.
Dalal, Avinash, Schmutz, Eric (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity: