Sciweavers

1717 search results - page 40 / 344
» A Computable Spectral Theorem
Sort
View
DAGSTUHL
2006
15 years 8 months ago
Semidefinite programming characterization and spectral adversary method for quantum complexity with noncommuting unitary queries
Generalizing earlier work characterizing the quantum query complexity of computing a function of an unknown classical "black box" function drawn from some set of such bl...
Howard Barnum
CVPR
2007
IEEE
16 years 8 months ago
Spectral Matting
We present spectral matting: a new approach to natural image matting that automatically computes a set of fundamental fuzzy matting components from the smallest eigenvectors of a ...
Anat Levin, Alex Rav-Acha, Dani Lischinski
FOCS
2000
IEEE
15 years 11 months ago
On Clusterings - Good, Bad and Spectral
We motivate and develop a natural bicriteria measure for assessing the quality of a clustering that avoids the drawbacks of existing measures. A simple recursive heuristic is shown...
Ravi Kannan, Santosh Vempala, Adrian Vetta
SIGGRAPH
1991
ACM
15 years 10 months ago
Spectrally optimal sampling for distribution ray tracing
Nonuniform sampling of images is a useful technique in computer graphics, because a properly designed pattern of samples can make aliasing take the form of high-frequency random n...
Don P. Mitchell
TLCA
1993
Springer
15 years 10 months ago
The Conservation Theorem revisited
This paper describes a method of proving strong normalization based on an extension of the conservation theorem. We introduce a structural notion of reduction that we call βS, and...
Philippe de Groote