We present new min-max relations in digraphs between the number of paths...
The task of building general agents that perform well over a wide range ...
In this work, we introduce a new graph convexity, that we call Cycle
Con...
The Grid Theorem of Robertson and Seymour [JCTB, 1986], is one of the mo...
A temporal digraph G is a triple (G, γ, λ) where G is
a digraph, γ is a ...
Acquiring abilities in the absence of a task-oriented reward function is...
Residual networks (ResNet) and weight normalization play an important ro...
Evolution Strategies (ES) emerged as a scalable alternative to popular
R...
Adaptive Computation Time for Recurrent Neural Networks (ACT) is one of ...
Recurrent Neural Networks (RNNs) continue to show outstanding performanc...
The increasing availability of affect-rich multimedia resources has bols...
This paper introduces an unsupervised framework to extract semantically ...
Visual multimedia have become an inseparable part of our digital social
...