39 citations · 89 across the 25 of their papers we have counts for
Showing 2019Show all
3 papers · 1 filter
math.CO2019
Long Cycles, Heavy Cycles and Cycle Decompositions in Digraphs
Charlotte Knierim, Maxime Larcher, Anders Martinsson +1
Hajós conjectured in 1968 that every Eulerian \(n\)-vertex graph can be decomposed into at most edge-disjoint cycles. This has been confirmed for some spec…
cs.DM2019
Navigating an Infinite Space with Unreliable Movements
Anders Martinsson, Jara Uitto
We consider a search problem on a -dimensional infinite grid with a single mobile agent. The goal of the agent is to find her way home, which is located in a grid cell chosen by…
cs.LG2019★ 5 cited
Optimal Kronecker-Sum Approximation of Real Time Recurrent Learning
Frederik Benzing, Marcelo Matheus Gauy, Asier Mujika +2
One of the central goals of Recurrent Neural Networks (RNNs) is to learn long-term dependencies in sequential data. Nevertheless, the most popular training method, Truncated Backpr…