325 search results - page 38 / 65 » Proofs of Restricted Shuffles |
CSFW
1998
IEEE
14 years 1 months ago
1998
IEEE
In previous work [16], we give a type system that guarantees that well-typed multithreaded programs are possibilistically noninterfering. If thread scheduling is probabilistic, ho...
MCS
2000
Springer
14 years 1 months ago
2000
Springer
The use of multiple features by a classifier often leads to a reduced probability of error, but the design of an optimal Bayesian classifier for multiple features is dependent on t...
CSR
2008
Springer
13 years 11 months ago
2008
Springer
Razborov and Rudich identified an imposing barrier that stands in the way of progress toward the goal of proving superpolynomial lower bounds on circuit size. Their work on "n...
DGCI
2008
Springer
13 years 11 months ago
2008
Springer
In this paper we prove that the function giving the frequency of a class of patterns of digital planes with respect to the slopes of the plane is continuous and piecewise affine, m...
EACL
2003
ACL Anthology
13 years 11 months ago
2003
ACL Anthology
Syntactic constraints in Koskenniemi’s Finite-State Intersection Grammar (FSIG) are logically less complex than their formalism (Koskenniemi et al., 1992) would suggest: It turn...