1089 search results - page 145 / 218 » Bounds on generalized Frobenius numbers |
EUROCRYPT
2004
Springer
14 years 2 months ago
2004
Springer
It is well-known that n players connected only by pairwise secure channels can achieve multi-party computation secure against an active adversary if and only if – t < n/2 of t...
WEBDB
2010
Springer
14 years 2 months ago
2010
Springer
We present a robust method for gathering relational facts from the Web, based on matching generalized patterns which are automatically learned from seed facts for relations of int...
DSN
2002
IEEE
14 years 1 months ago
2002
IEEE
This paper shows that, in an environment where we do not bound the number of faulty processes, the class P of Perfect failure detectors is the weakest (among realistic failure det...
IPMU
2010
Springer
14 years 28 days ago
2010
Springer
Abstract. Credal sets are closed convex sets of probability mass functions. The lower probabilities specified by a credal set for each element of the power set can be used as cons...
ATMOS
2007
13 years 10 months ago
2007
In this paper we study a general formulation of the train platforming problem, which contains as special cases all the versions previously considered in the literature as well as a...