507 search results - page 51 / 102 » Computing Sparse Multiples of Polynomials |
130
Voted
CORR
2011
Springer
14 years 5 months ago
2011
Springer
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...
116
click to vote
FSTTCS
2009
Springer
15 years 8 months ago
2009
Springer
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...
112
Voted
COCO
1989
Springer
15 years 6 months ago
1989
Springer
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...
154
click to vote
SIAMMAX
2011
14 years 5 months ago
2011
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...
138
Voted
VISUALIZATION
2002
IEEE
15 years 7 months ago
2002
IEEE
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...