2516 search results - page 27 / 504 » When is there a representer theorem |
195
click to vote
COCO
2010
Springer
15 years 10 months ago
2010
Springer
—Raz’s parallel repetition theorem [21] together with improvements of Holenstein [12] shows that for any two-prover one-round game with value at most 1 − (for ≤ 1/2), the v...
172
Voted
ECAI
2004
Springer
15 years 10 months ago
2004
Springer
We describe a flexible approach to automated reasoning, where non-theorems can be automatically altered to produce proved results which are related to the original. This is achieve...
146
Voted
COCO
2007
Springer
16 years 10 days ago
2007
Springer
Interactive hashing, introduced by Naor, Ostrovsky, Venkatesan and Yung (CRYPTO ’92), plays an important role in many cryptographic protocols. In particular, it is a major compo...
164
Voted
JAT
2011
15 years 1 months ago
2011
Stone-Weierstrass-type theorems for groups of group-valued functions with discrete range or discrete domain are obtained. We study criteria for a subgroup of the group of continuou...
152
Voted
ACMSE
2007
ACM
15 years 10 months ago
2007
ACM
In this paper, we present two new centralized group key management protocols based on the Chinese Remainder Theorem (CRT). By shifting more computing load onto the key server we o...