activity
20072026
most citedOn the decidability and complexity of Metric Temporal Logic over finite words

113 citations · 317 across the 70 of their papers we have counts for

collaborators
Showing 2016Show all

6 papers · 1 filter

cs.CC2016★ 2 cited

The Polytope-Collision Problem

Shaull Almagor, Joël Ouaknine, James Worrell

The Orbit Problem consists of determining, given a matrix and vectors , whether there exists such that .…

cs.LO2016★ 3 cited

Model Checking Flat Freeze LTL on One-Counter Automata

Antonia Lechner, Richard Mayr, Joël Ouaknine +2

Freeze LTL is a temporal logic with registers that is suitable for specifying properties of data words. In this paper we study the model checking problem for Freeze LTL on one-coun…

cs.FL2016★ 3 cited

On Restricted Nonnegative Matrix Factorization

Dmitry Chistikov, Stefan Kiefer, Ines Marušić +2

Nonnegative matrix factorization (NMF) is the problem of decomposing a given nonnegative matrix into a product of a nonnegative matrix and a nonne…

cs.CC2016

Nonnegative Matrix Factorization Requires Irrationality

Dmitry Chistikov, Stefan Kiefer, Ines Marušić +2

Nonnegative matrix factorization (NMF) is the problem of decomposing a given nonnegative matrix into a product of a nonnegative matrix and a nonne…

cs.CG2016★ 1 cited

Rational Bézier Curves Approximated by Bernstein-Jacobi Hybrid Polynomial Curves

Mao Shi

In this paper, we propose a linear method for approximation of rational Bézier curve with arbitrary degree polynomial curve. Based on weighted least-squares, the proble…

cs.DM2016★ 1 cited

Solvability of Matrix-Exponential Equations

Joël Ouaknine, Amaury Pouly, João Sousa-Pinto +1

We consider a continuous analogue of Babai et al.'s and Cai et al.'s problem of solving multiplicative matrix equations. Given square matrices , all…