915 search results - page 72 / 183 » Proof labeling schemes |
COMBINATORICS
2004
13 years 7 months ago
2004
Haglund and Loehr previously conjectured two equivalent combinatorial formulas for the Hilbert series of the Garsia-Haiman diagonal harmonics modules. These formulas involve weigh...
TNN
2010
13 years 2 months ago
2010
We consider the problem of semi-supervised feature selection, where we are given a small amount of labeled examples and a large amount of unlabeled examples. Since a small number ...
CSFW
2000
IEEE
13 years 11 months ago
2000
IEEE
We propose an approach to support confidentiality for mobile implementations of security-sensitive protocols using Java/JVM. An applet which receives and passes on confidential in...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
Many semantical aspects of programming languages are specified through calculi for constructing proofs: consider, for example, the specification of structured operational semantic...
EUROCRYPT
2010
Springer
14 years 24 days ago
2010
Springer
We construct the first public-key encryption scheme that is proven secure (in the standard model, under standard assumptions) even when the attacker gets access to encryptions of ...