62 search results - page 11 / 13 » Zero-Knowledge Sets with Short Proofs |
ICALP
2007
Springer
14 years 9 days ago
2007
Springer
While data compression and Kolmogorov complexity are both about effective coding of words, the two settings differ in the following respect. A compression algorithm or compressor...
IUI
2003
ACM
13 years 11 months ago
2003
ACM
Computational humor will be needed in interfaces, no less than other cognitive capabilities. There are many practical settings where computational humor will add value. Among them...
AAAI
1996
13 years 7 months ago
1996
The representation of narratives of actions and observations is a current issue in Knowledge Representation, where traditional plan-oriented treatments of action seem to fall shor...
EJC
2008
13 years 6 months ago
2008
Tension-continuous (shortly TT) mappings are mappings between the edge sets of graphs. They generalize graph homomorphisms. From another perspective, tension-continuous mappings a...
EJC
2008
13 years 6 months ago
2008
The distinguishing number D(G) of a graph G is the least integer d such that G has a labeling with d labels that is preserved only by a trivial automorphism. We prove that Cartesi...