Sciweavers

3946 search results - page 340 / 790
» The computational complexity of choice sets
Sort
View
CCS
2011
ACM
14 years 6 months ago
Eliminating the hypervisor attack surface for a more secure cloud
Cloud computing is quickly becoming the platform of choice for many web services. Virtualization is the key underlying technology enabling cloud providers to host services for a l...
Jakub Szefer, Eric Keller, Ruby B. Lee, Jennifer R...
CCS
2007
ACM
16 years 1 months ago
Program obfuscation: a quantitative approach
Despite the recent advances in the theory underlying obfuscation, there still is a need to evaluate the quality of practical obfuscating transformations more quickly and easily. T...
Bertrand Anckaert, Matias Madou, Bjorn De Sutter, ...
GECCO
2005
Springer
220views Optimization» more  GECCO 2005»
16 years 11 days ago
Scale invariant pareto optimality: a meta--formalism for characterizing and modeling cooperativity in evolutionary systems
This article describes a mathematical framework for characterizing cooperativity in complex systems subject to evolutionary pressures. This framework uses three foundational compo...
Mark Fleischer
110
Voted
EDBT
2009
ACM
100views Database» more  EDBT 2009»
15 years 11 months ago
A view selection algorithm with performance guarantee
A view selection algorithm takes as input a fact table and computes a set of views to store in order to speed up queries. The performance of view selection algorithm is usually me...
Nicolas Hanusse, Sofian Maabout, Radu Tofan
CGF
2008
141views more  CGF 2008»
15 years 6 months ago
Accelerating Ray Tracing using Constrained Tetrahedralizations
In this paper we introduce the constrained tetrahedralization as a new acceleration structure for ray tracing. A constrained tetrahedralization of a scene is a tetrahedralization ...
Ares Lagae, Philip Dutré