1802 search results - page 318 / 361 » Sparse Computations with PEI |
109
click to vote
TOG
2010
14 years 6 months ago
2010
Accurately rendering glossy materials in design applications, where previewing and interactivity are important, remains a major challenge. While many fast global illumination solu...
TSP
2010
14 years 6 months ago
2010
We consider the problem of recursively and causally reconstructing time sequences of sparse signals (with unknown and time-varying sparsity patterns) from a limited number of noisy...
91
Voted
CORR
2011
Springer
14 years 3 months ago
2011
Springer
The richness of natural images makes the quest for optimal representations in image processing and computer vision challenging. The latter observation has not prevented the design...
106
click to vote
MOC
2011
14 years 2 months ago
2011
Abstract. We present three algorithms to calculate Φn(z), the nth cyclotomic polynomial. The first algorithm calculates Φn(z) by a series of polynomial divisions, which we perfo...
130
click to vote
SIAMMAX
2011
14 years 2 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...