Abstract—Set intersection is the core in a variety of problems, e.g. frequent itemset mining and sparse boolean matrix multiplication. It is well-known that large speed gains can...
ABSTRACT. We consider concurrent systems that can be modelled as 1-safe Petri nets communicating through a fixed set of buffers (modelled as unbounded places). We identify a param...
Kadin [6] showed that if the Polynomial Hierarchy (PH) has infinitely many levels, then for all k, PSAT[k] ⊂ PSAT[k+1]. This paper extends Kadin’s technique and shows that a p...
We investigate an acceleration technique for restarted Krylov subspace methods for computing the action of a function of a large sparse matrix on a vector. Its effect is to ultima...
Typically 3-D MR and CT scans have a relatively high resolution in the scanning X;Y plane, but much lower resolution in the axial Z direction. This non-uniform sampling of an obje...
Ken Museth, David E. Breen, Leonid Zhukov, Ross T....