In this paper, we concentrate on the problem of computing a Voronoi diagram using Hypercube model of computation. The main contribution of this work is the O(log3 n) parallel algor...
-- Boolean SAT problems are widespread in current demanding applications, most notably model checking for both hardware and software. It has long been known that the clause-to-vari...
Abstract: In recent works for high performance computing, computation with DNA molecules, that is, DNA computing, has had considerable attention as one of non-silicon based computi...
The displacement structure is extended to a Kronecker matrix W Z. A new class of Kronecker-like matrices with the displacement rank r, r < n will be formulated and presented. ...
We prove an upper bound on the convergence rate of Markov Chain Monte Carlo (MCMC) algorithms for the important special case when the state space can be aggregated into a smaller ...