1021 search results - page 68 / 205 » Fast Approximate PCPs |
129
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
Adaptive sparse coding methods learn a possibly overcomplete set of basis functions, such that natural image patches can be reconstructed by linearly combining a small subset of t...
DM
2006
15 years 2 months ago
2006
In this paper, we study the problem of sampling (exactly) uniformly from the set of linear extensions of an arbitrary partial order. Previous Markov chain techniques have yielded ...
SIAMSC
2008
15 years 1 months ago
2008
To approximate convolutions which occur in evolution equations with memory terms, a variable-stepsize algorithm is presented for which advancing N steps requires only O(N log N) op...
108
click to vote
IPPS
2010
IEEE
14 years 12 months ago
2010
IEEE
This work presents the first extensive study of singlenode performance optimization, tuning, and analysis of the fast multipole method (FMM) on modern multicore systems. We consid...
EOR
2011
14 years 9 months ago
2011
: We analyse a single echelon single item inventory system where the demand and the lead time are stochastic. Demand is modelled as a compound Poisson process and the stock is cont...