441 search results - page 16 / 89 » A Method for Proving Observational Equivalence |
CSFW
2010
IEEE
14 years 22 days ago
2010
IEEE
In recent years it has been shown that dynamic monitoring can be used to soundly enforce information flow policies. For programs distributed in source or bytecode form, the use o...
KDD
2005
ACM
14 years 9 months ago
2005
ACM
Several authors have suggested viewing boosting as a gradient descent search for a good fit in function space. At each iteration observations are re-weighted using the gradient of...
ICDAR
2011
IEEE
12 years 8 months ago
2011
IEEE
Abstract—According to characteristics of Mongolian wordformation, a method for removing inflectional suffixes from word images of the Mongolian Kanjur is proposed in this paper. ...
AAAI
1997
13 years 10 months ago
1997
Many stochastic planning problems can be represented using Markov Decision Processes (MDPs). A difficulty with using these MDP representations is that the common algorithms for so...
CP
2004
Springer
14 years 16 days ago
2004
Springer
This paper presents an algorithm that achieves hyper-arc consistency for the soft alldifferent constraint. To this end, we prove and exploit the equivalence with a minimum-cost flo...