Results 221 to 230 of about 478,221 (266)
, 1982 Some of the next articles are maybe not open access.
Related searches:
Related searches:
Strong and Efficient Consistency with Consistency-aware Durability
ACM Transactions on Storage, 2021We introduce consistency-aware durability or C ad , a new approach to durability in distributed storage that enables strong consistency while delivering high performance. We demonstrate the efficacy of this approach by designing cross-client monotonic reads , a novel ...
Aishwarya Ganesan +3 more
openaire +1 more source
Spatial autoregression model: strong consistency
Statistics & Probability Letters, 2003zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bhattacharyya, B. B. +3 more
openaire +2 more sources
Basis token consistency: supporting strong Web cache consistency
Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE, 2003With Web caching and cache-related services like CDNs and edge services playing an increasingly significant role in the modern Internet, the problem of the weak consistency and coherence provisions in current Web protocols is drawing increasing attention.
A.D. Bradley, A. Bestavros
openaire +1 more source
Strong consistency of Lasso estimators
Sankhya A, 2011zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chatterjee, A., Lahiri, S. N.
openaire +2 more sources
2019 International Conference on Computer Science, Information Technology, and Electrical Engineering (ICOMITEE), 2019
Secret sharing is a cryptographic primitive used to securely distribute a secret value S among n participants such that only predetermined subsets of these participants (called access sets) can later reconstruct S. Such a scheme is said to be secure in the information theoretic setting if an adversary with unlimited computational power cannot reduce ...
Louis Cianciullo +3 more
openaire +1 more source
Secret sharing is a cryptographic primitive used to securely distribute a secret value S among n participants such that only predetermined subsets of these participants (called access sets) can later reconstruct S. Such a scheme is said to be secure in the information theoretic setting if an adversary with unlimited computational power cannot reduce ...
Louis Cianciullo +3 more
openaire +1 more source
Strong Consistency in Nonlinear Regression
Econometric Theory, 1990Sufficient conditions are given to ensure the existence of a sequence of strongly consistent estimators of an unknown parameter for a nonlinear regression model. The parameter space includes all separable metric spaces but is not assumed to be compact.
Richardson, G. D., Bhattacharyya, B. B.
openaire +2 more sources
1991
In the previous chapter, we have considered the problem of implementing a given social choice correspondence in strong Nash equilibria. In order to do this, we had to find a game form such that at each profile, the set of strong Nash equilibria of the resulting game coincided with the values of the social choice correspondence at this profile.
J. Abdou, H. Keiding
openaire +1 more source
In the previous chapter, we have considered the problem of implementing a given social choice correspondence in strong Nash equilibria. In order to do this, we had to find a game form such that at each profile, the set of strong Nash equilibria of the resulting game coincided with the values of the social choice correspondence at this profile.
J. Abdou, H. Keiding
openaire +1 more source