4324 search results - page 12 / 865 » A Generalized Representer Theorem |
84
Voted
JCT
2007
15 years 1 months ago
2007
Let the k-graph Fank consist of k edges that pairwise intersect exactly in one vertex x, plus one more edge intersecting each of these edges in a vertex different from x. We prov...
112
click to vote
TCC
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. We consider compositional properties of reactive systems that are secure in a cryptographic sense. We follow the well-known simulatability approach of modern cryptography...
108
Voted
TIT
2010
14 years 8 months ago
2010
We consider three capacity definitions for composite channels with channel side information at the receiver. A composite channel consists of a collection of different channels with...
ICDCS
2010
IEEE
15 years 5 months ago
2010
IEEE
—Aspnes et al [2] introduced an innovative game for modeling the containment of the spread of viruses and worms (security breaches) in a network. In this model, nodes choose to i...
139
click to vote
ICALP
2009
Springer
16 years 2 months ago
2009
Springer
We consider graphical games in which edges are zero-sum games between the endpoints/players; the payoff of a player is the sum of the payoffs from each incident edge. We give a si...