Sciweavers

1806 search results - page 65 / 362
» Some Functions Computable with a Fused-Mac
Sort
View
JACM
2007
85views more  JACM 2007»
15 years 5 months ago
The rational numbers as an abstract data type
onal Numbers as an Abstract Data Type1 J A Bergstra2 University of Amsterdam, Informatics Institute, Kruislaan 403, 1098 SJ Amsterdam, The Netherlands J V Tucker3 Department of Com...
Jan A. Bergstra, J. V. Tucker
FOCS
1998
IEEE
15 years 10 months ago
Quantum Lower Bounds by Polynomials
We examine the number T of queries that a quantum network requires to compute several Boolean functions on f0;1gN in the black-box model. We show that, in the blackbox model, the ...
Robert Beals, Harry Buhrman, Richard Cleve, Michel...
SCALESPACE
1999
Springer
15 years 10 months ago
Scales in Natural Images and a Consequence on their Bounded Variation Norm
This paper introduces a new method for analyzing scaling phenomena in natural images, and draws some consequences as to whether natural images belong to the space of functions with...
Luis Alvarez, Yann Gousseau, Jean-Michel Morel
SIGGRAPH
1999
ACM
15 years 10 months ago
Computing Exact Shadow Irradiance Using Splines
We present a solution to the general problem of characterizing shadows in scenes involving a uniform polygonal area emitter and a polygonal occluder in arbitrary position by manif...
Michael M. Stark, Elaine Cohen, Tom Lyche, Richard...
APPROX
2008
Springer
88views Algorithms» more  APPROX 2008»
15 years 7 months ago
Limitations of Hardness vs. Randomness under Uniform Reductions
We consider (uniform) reductions from computing a function f to the task of distinguishing the output of some pseudorandom generator G from uniform. Impagliazzo and Wigderson [IW]...
Dan Gutfreund, Salil P. Vadhan