Sciweavers

6568 search results - page 322 / 1314
» Reducing the Complexity of Reductions
Sort
View
CGF
2008
122views more  CGF 2008»
15 years 7 months ago
Accurate Shadows by Depth Complexity Sampling
The accurate generation of soft shadows is a particularly computationally intensive task. In order to reduce rendering time, most real-time and offline applications decorrelate th...
Vincent Forest, Loïc Barthe, Mathias Paulin
ENTCS
2008
102views more  ENTCS 2008»
15 years 7 months ago
Soft Linear Logic and Polynomial Complexity Classes
We describe some results inspired to Lafont's Soft Linear Logic (SLL) which is a subsystem of second-order linear logic with restricted rules for exponentials, correct and co...
Marco Gaboardi, Jean-Yves Marion, Simona Ronchi De...
CORR
2007
Springer
132views Education» more  CORR 2007»
15 years 6 months ago
Matroid Pathwidth and Code Trellis Complexity
We relate the notion of matroid pathwidth to the minimum trellis state-complexity (which we term trellis-width) of a linear code, and to the pathwidth of a graph. By reducing from ...
Navin Kashyap
TIP
2008
205views more  TIP 2008»
15 years 6 months ago
Image Denoising Using Derotated Complex Wavelet Coefficients
A method for removing additive Gaussian noise from digital images is described. It is based on statistical modeling of the coefficients of a redundant, oriented, complex multiscale...
Mark Miller, Nick G. Kingsbury
TSMC
2008
94views more  TSMC 2008»
15 years 6 months ago
Test Sequencing in Complex Manufacturing Systems
Testing complex manufacturing systems, such as an ASML [1] lithographic machine, takes up to 45% of the total development time of a system. The problem of which tests must be execu...
R. Boumen, I. S. M. de Jong, J. W. H. Vermunt, J. ...