Sciweavers

234 search results - page 35 / 47
» Proof Nets and the Identity of Proofs
Sort
View
65
Voted
CORR
2006
Springer
80views Education» more  CORR 2006»
14 years 10 months ago
Exact Failure Frequency Calculations for Extended Systems
This paper shows how the steady-state availability and failure frequency can be calculated in a single pass for very large systems, when the availability is expressed as a product...
Annie Druault-Vicard, Christian Tanguy
DCG
2006
68views more  DCG 2006»
14 years 10 months ago
The Stirling Polynomial of a Simplicial Complex
We introduce a new encoding of the face numbers of a simplicial complex, its Stirling polynomial, that has a simple expression obtained by multiplying each face number with an app...
Gábor Hetyei
103
Voted
ISCI
2008
160views more  ISCI 2008»
14 years 10 months ago
Certificateless undeniable signature scheme
In this paper, we present the first certificateless undeniable signature scheme. The scheme does not suffer from the key escrow problem, which is inherent in identity based crypto...
Shanshan Duan
88
Voted
CP
2010
Springer
14 years 8 months ago
Testing Expressibility Is Hard
We study the expressibility problem: given a finite constraint language Γ on a finite domain and another relation R, can Γ express R? We prove, by an explicit family of example...
Ross Willard
MA
2010
Springer
135views Communications» more  MA 2010»
14 years 8 months ago
Asymptotic expansion of the minimum covariance determinant estimators
In Cator and Lopuha¨a [3] an asymptotic expansion for the MCD estimators is established in a very general framework. This expansion requires the existence and non-singularity of ...
Eric A. Cator, Hendrik P. Lopuhaä