Sciweavers

291 search results - page 50 / 59
» Dynamic Memory Allocation for Large Query Execution
Sort
View
CGI
1998
IEEE
15 years 6 months ago
Fast Approximate Quantitative Visibility for Complex Scenes
Ray tracing and Monte-Carlo based global illumination, as well as radiosity and other finite-element based global illumination methods, all require repeated evaluation of quantita...
Yiorgos Chrysanthou, Daniel Cohen-Or, Dani Lischin...
JSA
2000
116views more  JSA 2000»
15 years 1 months ago
Distributed vector architectures
Integrating processors and main memory is a promising approach to increase system performance. Such integration provides very high memory bandwidth that can be exploited efficientl...
Stefanos Kaxiras
DKE
2002
107views more  DKE 2002»
15 years 1 months ago
View selection using randomized search
An important issue in data warehouse development is the selection of a set of views to materialize in order to accelerate OLAP queries, given certain space and maintenance time co...
Panos Kalnis, Nikos Mamoulis, Dimitris Papadias
NDSS
2008
IEEE
15 years 8 months ago
Automated Whitebox Fuzz Testing
Fuzz testing is an effective technique for finding security vulnerabilities in software. Traditionally, fuzz testing tools apply random mutations to well-formed inputs of a progr...
Patrice Godefroid, Michael Y. Levin, David A. Moln...
ICLP
2010
Springer
15 years 5 months ago
Improving the Efficiency of Gibbs Sampling for Probabilistic Logical Models by Means of Program Specialization
Abstract. There is currently a large interest in probabilistic logical models. A popular algorithm for approximate probabilistic inference with such models is Gibbs sampling. From ...
Daan Fierens