output
19952026
most citedLand Cover Classification via Multi-temporal Spatial Data by Recurrent Neural Networks

291 citations

researchers with a paper here

Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.

collaborating institutions
Showing 2012 · cs.DMShow all

5 papers · 2 filters

cs.DM2012★ 2 cited

Towards a statement of the S-adic conjecture through examples

Fabien Durand, Julien Leroy, Gwénaël Richomme

The -adic conjecture claims that there exists a condition such that a sequence has a sub-linear complexity if and only if it is an -adic sequence satisfying Condition …

cs.DM2012★ 1 cited

Topological arguments for Kolmogorov complexity

Alexander Shen, Andrei Romashchenko

We present several application of simple topological arguments in problems of Kolmogorov complexity. Basically we use the standard fact from topology that the disk is simply connec…

cs.DM2012★ 3 cited

The Cost of Perfection for Matchings in Graphs

Emilio Vital Brazil, Guilherme D. da Fonseca, Celina de Figueiredo +1

Perfect matchings and maximum weight matchings are two fundamental combinatorial structures. We consider the ratio between the maximum weight of a perfect matching and the maximum…

cs.DM2012

Toroidal maps : Schnyder woods, orthogonal surfaces and straight-line representations

Daniel Gonçalves, Benjamin Lévêque

A Schnyder wood is an orientation and coloring of the edges of a planar map satisfying a simple local property. We propose a generalization of Schnyder woods to graphs embedded on…

cs.DM2012★ 1 cited

The Maximum Clique Problem in Multiple Interval Graphs

Mathew C. Francis, Daniel Gonçalves, Pascal Ochem

Multiple interval graphs are variants of interval graphs where instead of a single interval, each vertex is assigned a set of intervals on the real line. We study the complexity of…