491 search results - page 4 / 99 » Random Paintbrush Transformation |
STOC
2012
ACM
11 years 8 months ago
2012
ACM
We consider the problem of computing the k-sparse approximation to the discrete Fourier transform of an ndimensional signal. We show: • An O(k log n)-time randomized algorithm f...
IPPS
2000
IEEE
13 years 10 months ago
2000
IEEE
In this paper we develop a variant of a previously proposed method the regenerative randomization method for the transient analysis of dependability performability models. The va...
APPROX
2008
Springer
13 years 7 months ago
2008
Springer
Random projection methods give distributions over k
MOC
1998
13 years 5 months ago
1998
Abstract. A sweep-plane algorithm of Lawrence for convex polytope computation is adapted to generate random tuples on simple polytopes. In our method an affine hyperplane is swept ...
ENTCS
2002
13 years 5 months ago
2002
The difficulty of finding errors caused by unexpected interleavings of threads in concurrent programs is well known. Model checkers can pinpoint such errors and verify correctness...