1199 search results - page 191 / 240 » Parameterized Proof Complexity |
126
Voted
CORR
2011
Springer
14 years 10 months ago
2011
Springer
nt programs, programming abstractions for data parallel programs, software model checking for confidentiality, electronic voting security, synthesis of interface specons for Java ...
150
Voted
SIAMIS
2011
14 years 10 months ago
2011
We define a novel metric on the space of closed planar curves which decomposes into three intuitive components. According to this metric centroid translations, scale changes and ...
185
Voted
JMLR
2010
14 years 10 months ago
2010
With the goal to generate more scalable algorithms with higher efficiency and fewer open parameters, reinforcement learning (RL) has recently moved towards combining classical tec...
157
click to vote
ECOOP
2010
Springer
15 years 8 months ago
2010
Springer
We reduce JavaScript to a core calculus structured as a small-step operational semantics. We present several peculiarities of the language and show that our calculus models them. W...
120
click to vote
STOC
2003
ACM
16 years 3 months ago
2003
ACM
Let H be a fixed directed graph on h vertices, let G be a directed graph on n vertices and suppose that at least n2 edges have to be deleted from it to make it H-free. We show tha...