Search Results - "Nogneng, Dorian"

On the evaluation of some sparse polynomials by Dorian Nogneng, Éric Schost

“…for various choices of coefficients p_i. First, we take p_i=p^i, for some fixed p; in this case, we address the question of fast evaluation at a given point in…”
Get full text

Scheduling with gaps: new models and algorithms by Chrobak, Marek, Golin, Mordecai, Lam, Tak-Wah, Nogneng, Dorian

“…We consider scheduling problems for unit jobs with release times, where the number or size of the gaps in the schedule is taken into consideration, either in…”
Get full text

Informative Descriptor Preservation via Commutativity for Shape Matching by Nogneng, Dorian, Ovsjanikov, Maks

“…We consider the problem of non‐rigid shape matching, and specifically the functional maps framework that was recently proposed to find correspondences between…”
Get full text

On semiring complexity of Schur polynomials by Fomin, Sergey, Grigoriev, Dima, Nogneng, Dorian, Schost, Éric

“…Semiring complexity is the version of arithmetic circuit complexity that allows only two operations: addition and multiplication. We show that semiring…”
Get full text

On semiring complexity of Schur polynomials by Fomin, Sergey, Grigoriev, Dima, Nogneng, Dorian, Schost, Eric

“…Semiring complexity is the version of arithmetic circuit complexity that allows only two operations: addition and multiplication. We show that when the number…”
Get full text

Scheduling with Gaps: New Models and Algorithms by Chrobak, Marek, Golin, Mordecai, Lam, Tak-Wah, Nogneng, Dorian

“…We consider scheduling problems for unit jobs with release times, where the number or size of the gaps in the schedule is taken into consideration, either in…”
Get full text