1089 search results - page 148 / 218 » Bounds on generalized Frobenius numbers |
CCS
2011
ACM
12 years 9 months ago
2011
ACM
We consider security properties of cryptographic protocols that can be modeled using the notion of trace equivalence. The notion of equivalence is crucial when specifying privacy-...
INFOCOM
2012
IEEE
11 years 11 months ago
2012
IEEE
Abstract—We aim to enhance the end-to-end rate of a general dual-hop relay network with multiple channels and finite modulation formats, by jointly optimizing channel pairing, p...
IJCAI
1989
13 years 10 months ago
1989
This paper considers the Valiant framework as it is applied to the task of learning logical concepts from random examples. It is argued that the current interpretation of this Val...
FSTTCS
2009
Springer
14 years 3 months ago
2009
Springer
We study the branching program complexity of the tree evaluation problem, introduced in [BCM+09a] as a candidate for separating NL from LogCFL. The input to the problem is a roote...
PODC
2009
ACM
14 years 9 months ago
2009
ACM
We present a randomized coloring algorithm for the unstructured radio network model, a model comprising autonomous nodes, asynchronous wake-up, no collision detection and an unkno...