612 search results - page 112 / 123 » Hardness assumptions in the foundations of theoretical compu... |
CCS
2006
ACM
13 years 11 months ago
2006
ACM
Role engineering, the task of defining roles and associating permissions to them, is essential to realize the full benefits of the role-based access control paradigm. Essentially,...
FPGA
2004
ACM
13 years 11 months ago
2004
ACM
Pattern matching for network security and intrusion detection demands exceptionally high performance. Much work has been done in this field, and yet there is still significant roo...
OOPSLA
1995
Springer
13 years 11 months ago
1995
Springer
All object-oriented languages provide support for subtype polymorphism, which allows the writing of generic code that works for families of related types. There is also a need, ho...
CCS
2008
ACM
13 years 9 months ago
2008
ACM
By functionally decomposing a specific algorithm (the hierarchical secure aggregation algorithm of Chan et al. [3] and Frikken et al. [7]), we uncover a useful general functionali...
SIGECOM
2008
ACM
13 years 7 months ago
2008
ACM
We provide tight information-theoretic lower bounds for the welfare maximization problem in combinatorial auctions. In this problem, the goal is to partition m items among k bidde...