11066 search results - page 205 / 2214 » Linearity in Process Languages |
152
click to vote
RTA
2005
Springer
15 years 9 months ago
2005
Springer
We present a new method for proving termination of term rewriting systems automatically. It is a generalization of the match bound method for string rewriting. To prove that a term...
153
click to vote
JMLR
2012
13 years 6 months ago
2012
We transform the outputs of each hidden neuron in a multi-layer perceptron network to have zero output and zero slope on average, and use separate shortcut connections to model th...
146
click to vote
JMLR
2012
13 years 6 months ago
2012
This document contains supplementary material to the article ‘Statistical test for consistent estimation of causal effects in linear non-Gaussian models’, AISTATS 2012. A tabl...
134
click to vote
ASIACRYPT
2006
Springer
15 years 7 months ago
2006
Springer
Non-interactive zero-knowledge proofs play an essential role in many cryptographic protocols. We suggest several NIZK proof systems based on prime order groups with a bilinear map...
129
click to vote
ORDER
2007
15 years 3 months ago
2007
Abstract. We analyze results on well-partial-orderings from the viewpoint of computability theory, and we answer a question posed by Diana Schmidt. We obtain the following results....