Results 1  10
of
2,793,813
Proposed NIST Standard for RoleBased Access Control
, 2001
"... In this article we propose a standard for rolebased access control (RBAC). Although RBAC models have received broad support as a generalized approach to access control, and are well recognized for their many advantages in performing largescale authorization management, no single authoritative def ..."
Abstract

Cited by 520 (9 self)
 Add to MetaCart
In this article we propose a standard for rolebased access control (RBAC). Although RBAC models have received broad support as a generalized approach to access control, and are well recognized for their many advantages in performing largescale authorization management, no single authoritative
Supplementary material 1 Previously proposed recurrences
"... According to notation in [1]: M is the number of states in an HMM, End is the silent end state, Start is the silent start state, Ti,j is transition probability between states i and j, Ei(γ) is probability of emitting symbol γ from state i, P(X) is probability of sequence X, xk is the kth letter in i ..."
Abstract
 Add to MetaCart
According to notation in [1]: M is the number of states in an HMM, End is the silent end state, Start is the silent start state, Ti,j is transition probability between states i and j, Ei(γ) is probability of emitting symbol γ from state i, P(X) is probability of sequence X, xk is the kth letter in input sequence X of length L, where Xk is the sequence of letters from the beginning of sequence X up to the sequence position k. f(Xk, n) is the forward probability, i.e. is the sum of probabilities of all state paths that finish in state n at sequence position k. ti,j(Xk, l) denotes the weighted sum of probabilities of state paths that finish in state l at sequence position k of sequence X and that contain at least one i → j transition, where the weight for each state path is equal to its number of i → j transitions. ei(γ, Xk, l) denotes the weighted sum of probabilities of state paths that finish at sequence position k in state l for which state i reads letter γ at least once, the weight for each state path being equal to the number of times state i reads letter γ. 1.1 Transition estimate recurrences Initialization f(X0, m) = ti,j(X0, m) = 0. 1, if m = Start
Fuzzy extractors: How to generate strong keys from biometrics and other noisy data. Technical Report 2003/235, Cryptology ePrint archive, http://eprint.iacr.org, 2006. Previous version appeared at EUROCRYPT 2004
 34 [DRS07] [DS05] [EHMS00] [FJ01] Yevgeniy Dodis, Leonid Reyzin, and Adam
, 2004
"... We provide formal definitions and efficient secure techniques for • turning noisy information into keys usable for any cryptographic application, and, in particular, • reliably and securely authenticating biometric data. Our techniques apply not just to biometric information, but to any keying mater ..."
Abstract

Cited by 532 (38 self)
 Add to MetaCart
material that, unlike traditional cryptographic keys, is (1) not reproducible precisely and (2) not distributed uniformly. We propose two primitives: a fuzzy extractor reliably extracts nearly uniform randomness R from its input; the extraction is errortolerant in the sense that R will be the same even
A Simple Estimator of Cointegrating Vectors in Higher Order Cointegrated Systems
 ECONOMETRICA
, 1993
"... Efficient estimators of cointegrating vectors are presented for systems involving deterministic components and variables of differing, higher orders of integration. The estimators are computed using GLS or OLS, and Wald Statistics constructed from these estimators have asymptotic x2 distributions. T ..."
Abstract

Cited by 507 (3 self)
 Add to MetaCart
. These and previously proposed estimators of cointegrating vectors are used to study longrun U.S. money (Ml) demand. Ml demand is found to be stable over 19001989; the 95 % confidence intervals for the income elasticity and interest rate semielasticity are (.88,1.06) and (.13,.08), respectively. Estimates based
Statistical phrasebased translation
, 2003
"... We propose a new phrasebased translation model and decoding algorithm that enables us to evaluate and compare several, previously proposed phrasebased translation models. Within our framework, we carry out a large number of experiments to understand better and explain why phrasebased models outpe ..."
Abstract

Cited by 894 (10 self)
 Add to MetaCart
We propose a new phrasebased translation model and decoding algorithm that enables us to evaluate and compare several, previously proposed phrasebased translation models. Within our framework, we carry out a large number of experiments to understand better and explain why phrasebased models
SURF: Speeded Up Robust Features
 ECCV
"... Abstract. In this paper, we present a novel scale and rotationinvariant interest point detector and descriptor, coined SURF (Speeded Up Robust Features). It approximates or even outperforms previously proposed schemes with respect to repeatability, distinctiveness, and robustness, yet can be comp ..."
Abstract

Cited by 842 (13 self)
 Add to MetaCart
Abstract. In this paper, we present a novel scale and rotationinvariant interest point detector and descriptor, coined SURF (Speeded Up Robust Features). It approximates or even outperforms previously proposed schemes with respect to repeatability, distinctiveness, and robustness, yet can
Predicting Internet Network Distance with CoordinatesBased Approaches
 In INFOCOM
, 2001
"... In this paper, we propose to use coordinatesbased mechanisms in a peertopeer architecture to predict Internet network distance (i.e. roundtrip propagation and transmission delay) . We study two mechanisms. The first is a previously proposed scheme, called the triangulated heuristic, which is bas ..."
Abstract

Cited by 633 (5 self)
 Add to MetaCart
In this paper, we propose to use coordinatesbased mechanisms in a peertopeer architecture to predict Internet network distance (i.e. roundtrip propagation and transmission delay) . We study two mechanisms. The first is a previously proposed scheme, called the triangulated heuristic, which
A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack
 CRYPTO '98
, 1998
"... A new public key cryptosystem is proposed and analyzed. The scheme is quite practical, and is provably secure against adaptive chosen ciphertext attack under standard intractability assumptions. There appears to be no previous cryptosystem in the literature that enjoys both of these properties simu ..."
Abstract

Cited by 540 (16 self)
 Add to MetaCart
A new public key cryptosystem is proposed and analyzed. The scheme is quite practical, and is provably secure against adaptive chosen ciphertext attack under standard intractability assumptions. There appears to be no previous cryptosystem in the literature that enjoys both of these properties
Results 1  10
of
2,793,813