Sciweavers

7006 search results - page 1378 / 1402
» Approximation Algorithms
Sort
View
FOCS
1999
IEEE
14 years 3 months ago
Near-Optimal Conversion of Hardness into Pseudo-Randomness
Various efforts ([?, ?, ?]) have been made in recent years to derandomize probabilistic algorithms using the complexity theoretic assumption that there exists a problem in E = dti...
Russell Impagliazzo, Ronen Shaltiel, Avi Wigderson
VLDB
1999
ACM
140views Database» more  VLDB 1999»
14 years 3 months ago
Combining Histograms and Parametric Curve Fitting for Feedback-Driven Query Result-size Estimation
This paper aims to improve the accuracy of query result-size estimations in query optimizers by leveraging the dynamic feedback obtained from observations on the executed query wo...
Arnd Christian König, Gerhard Weikum
PLDI
1997
ACM
14 years 3 months ago
Componential Set-Based Analysis
Set-based analysis is a constraint-based whole program analysis that is applicable to functional and objectoriented programming languages. Unfortunately, the analysis is useless f...
Cormac Flanagan, Matthias Felleisen
ANSS
1996
IEEE
14 years 3 months ago
Computation of the Asymptotic Bias and Variance for Simulation of Markov Reward Models
The asymptotic bias and variance are important determinants of the quality of a simulation run. In particular, the asymptotic bias can be used to approximate the bias introduced b...
Aad P. A. van Moorsel, Latha A. Kant, William H. S...
SIGGRAPH
1993
ACM
14 years 2 months ago
Wavelet radiosity
Radiosity methods have been shown to be an effective means to solve the global illumination problem in Lambertian diffuse environments. These methods approximate the radiosity int...
Steven J. Gortler, Peter Schröder, Michael F....
« Prev « First page 1378 / 1402 Last » Next »