2168 search results - page 14 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
FOCS
1993
IEEE
13 years 11 months ago
1993
IEEE
This paper investigates the computational complexity of approximating several NPoptimization problems using the number of queries to an NP oracle as a complexity measure. The resu...
JMLR
2006
2006
Geometric Variance Reduction in Markov Chains: Application to Value Function and Gradient Estimation
13 years 7 months ago
We study a sequential variance reduction technique for Monte Carlo estimation of functionals in Markov Chains. The method is based on designing sequential control variates using s...
MMSEC
2006
ACM
14 years 1 months ago
2006
ACM
This paper presents a theoretical security analysis of lattice data hiding. The security depends on the secrecy of a dither signal that randomizes the codebook. If the same secret...
SACMAT
2006
ACM
14 years 1 months ago
2006
ACM
We introduce the concept, model, and policy-specific algorithms for inferring new access control decisions from previous ones. Our secondary and approximate authorization model (...
SIGMOD
1999
ACM
13 years 12 months ago
1999
ACM
Computing multidimensional aggregates in high dimensions is a performance bottleneck for many OLAP applications. Obtaining the exact answer to an aggregation query can be prohibit...