233 search results - page 27 / 47 » Semantical Counting Circuits |
118
click to vote
CRYPTO
2012
Springer
13 years 2 months ago
2012
Springer
We construct a functional encryption scheme secure against an a-priori bounded polynomial number of collusions for the class of all polynomial-size circuits. Our constructions req...
107
click to vote
ACL
1992
15 years 1 months ago
1992
For a very long time, it has been considered that the only way of automatically extracting similar groups of words from a text collection for which no semantic information exists ...
TIT
2008
14 years 11 months ago
2008
We address the well-known problem of determining the capacity of constrained coding systems. While the onedimensional case is well understood to the extent that there are technique...
DAC
2005
ACM
16 years 24 days ago
2005
ACM
As technology advances into the nanometer territory, the interconnect delay has become a first-order effect on chip performance. To handle this effect, the X-architecture has been...
FOCS
2008
IEEE
15 years 6 months ago
2008
IEEE
Razborov and Rudich have shown that so-called natural proofs are not useful for separating P from NP unless hard pseudorandom number generators do not exist. This famous result is...