262 search results - page 5 / 53 » Testing Linear Properties: Some general themes |
FOCS
2009
IEEE
14 years 2 months ago
2009
IEEE
— We show that for every fixed k, there is a linear time algorithm that decides whether or not a given graph has a vertex set X of order at most k such that G − X is planar (w...
NECO
2007
13 years 7 months ago
2007
It is well-known that, in unidentifiable models, the Bayes estimation provides much better generalization performance than the maximum likelihood (ML) estimation. However, its ac...
EUROCRYPT
2000
Springer
13 years 11 months ago
2000
Springer
We show that verifiable secret sharing (VSS) and secure multi-party computation (MPC) among a set of n players can efficiently be based on any linear secret sharing scheme (LSSS) f...
ENTCS
2008
13 years 8 months ago
2008
In [24] the authors studied the expressiveness of persistence in the asynchronous -calculus (A) wrt weak barbed congruence. The study is incomplete because it ignores the issue of...
CAV
1999
Springer
14 years 6 days ago
1999
Springer
Of special interest in formal verification are safety properties, which assert that the system always stays within some allowed region. A computation that violates a general linea...