199 search results - page 23 / 40 » Complexity of two dual criteria scheduling problems |
PODS
2000
ACM
14 years 2 days ago
2000
ACM
We study the problem of auditing databases which support statistical sum queries to protect the security of sensitive information; we focus on the special case in which the sensit...
MFCS
2009
Springer
14 years 2 months ago
2009
Springer
We consider finite graphs whose edges are labeled with elements, called colors, taken from a fixed finite alphabet. We study the problem of determining whether there is an infi...
ISCA
2012
IEEE
11 years 10 months ago
2012
IEEE
When multiple processor (CPU) cores and a GPU integrated together on the same chip share the off-chip main memory, requests from the GPU can heavily interfere with requests from t...
IPPS
2010
IEEE
13 years 5 months ago
2010
IEEE
In this paper, we study the problem of finding optimal mappings for several independent but concurrent workflow applications, in order to optimize performance-related criteria tog...
ECCC
2011
13 years 2 months ago
2011
Polynomial identity testing (PIT) problem is known to be challenging even for constant depth arithmetic circuits. In this work, we study the complexity of two special but natural ...