6142 search results - page 326 / 1229 » The Complexity of Partition Functions |
164
click to vote
CHARME
2005
Springer
16 years 6 days ago
2005
Springer
Abstract. We define and study a quantitative generalization of the traditional boolean framework of model-based specification and verification. In our setting, propositions have...
227
Voted
EUROCRYPT
2010
Springer
15 years 11 months ago
2010
Springer
In this paper, we present two fully secure functional encryption schemes. Our first result is a fully secure attribute-based encryption (ABE) scheme. Previous constructions of AB...
164
click to vote
INFOCOM
1999
IEEE
15 years 11 months ago
1999
IEEE
Abstract-The Internet today provides no support for privacy or authentication of multicast packets. However,an increasing number of applications will require secure multicast servi...
149
click to vote
CSR
2006
Springer
15 years 10 months ago
2006
Springer
We show that two equivalent K-automata are conjugate to a third one, when K is equal to B, N, Z, or any (skew) field and that the same holds true for functional tranducers as well....
196
click to vote
SPAA
2010
ACM
15 years 6 months ago
2010
ACM
We develop logarithmic approximation algorithms for extremely general formulations of multiprocessor multiinterval offline task scheduling to minimize power usage. Here each proce...