Sciweavers

1410 search results - page 244 / 282
» Proving theorems by reuse
Sort
View
TCS
2008
13 years 9 months ago
On strong normalization and type inference in the intersection type discipline
We introduce a new unification procedure for the type inference problem in the intersection type discipline. It is well known that type inference in this case should succeed exact...
Gérard Boudol
ISCI
2007
135views more  ISCI 2007»
13 years 9 months ago
Generalising the array split obfuscation
An obfuscation is a behaviour-preserving program transformation whose aim is to make a program “harder to understand”. Obfuscations are mainly applied to make reverse engineer...
Stephen Drape
TNN
2008
106views more  TNN 2008»
13 years 9 months ago
Stability and Hopf Bifurcation of a General Delayed Recurrent Neural Network
In this paper, stability and bifurcation of a general recurrent neural network with multiple time delays is considered, where all the variables of the network can be regarded as bi...
Wenwu Yu, Jinde Cao, Guanrong Chen
JCT
2007
93views more  JCT 2007»
13 years 9 months ago
Generating bricks
A brick is a 3-connected graph such that the graph obtained from it by deleting any two distinct vertices has a perfect matching. The importance of bricks stems from the fact that...
Serguei Norine, Robin Thomas
APAL
2004
105views more  APAL 2004»
13 years 9 months ago
Dual weak pigeonhole principle, Boolean complexity, and derandomization
We study the extension (introduced as BT in [5]) of the theory S1 2 by instances of the dual (onto) weak pigeonhole principle for p-time functions, dWPHP(PV )x x2 . We propose a n...
Emil Jerábek