16843 search results - page 283 / 3369 » On Generalized Authorization Problems |
182
click to vote
COCOA
2009
Springer
15 years 10 months ago
2009
Springer
stract to be announcedPlenary session 09:00-10:00 Panos M, Pardalos, University of Florida, USA Tea Break 10:00-10:20 At the 1st floor 10:20-10:45 Polynomial Approximation Schemes ...
176
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
A celebrated theorem of Savitch [Sav70] states that NSPACE(S) ⊆ DSPACE(S2 ). In particular, Savitch gave a deterministic algorithm to solve ST-CONNECTIVITY (an NL-complete probl...
142
click to vote
EUSFLAT
2003
15 years 8 months ago
2003
Bi-capacities have been presented recently by the authors as a natural generalization of capacities (fuzzy measures). Usual concepts as M¨obius transform, Shapley value and inter...
195
click to vote
CSFW
2011
IEEE
14 years 6 months ago
2011
IEEE
—In this paper, we investigate the computational complexity of quantitative information flow (QIF) problems. Information-theoretic quantitative relaxations of noninterference (b...
183
click to vote
STOC
2009
ACM
16 years 7 months ago
2009
ACM
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...