output
20022025
most citedBalance and Abelian complexity of the Tribonacci word

36 citations

23 papers

cs.AI2025

Integer Linear Programming Preprocessing for Maximum Satisfiability

Jialu Zhang, Chu-Min Li, Sami Cherif +2

The Maximum Satisfiability problem (MaxSAT) is a major optimization challenge with numerous practical applications. In recent MaxSAT evaluations, most MaxSAT solvers have incorpora…

cs.RO2025

Event-based Optical Marker Systems: A survey

Nafiseh Jabbari Tofighi, Maxime Robic, Fabio Morbidi +1

The advent of event-based cameras, with their low latency, high dynamic range, and reduced power consumption, marked a turning point in machine perception and robotic vision. In~pa…

cs.CV2024★ 1 cited

Visual Gyroscope: Combination of Deep Learning Features and Direct Alignment for Panoramic Stabilization

Bruno Berenguel-Baeta, Antoine N. Andre, Guillaume Caron +2

In this article we present a visual gyroscope based on equirectangular panoramas. We propose a new pipeline where we take advantage of combining three different methods to obtain a…

cs.CV2023★ 17 cited

MOISST: Multimodal Optimization of Implicit Scene for SpatioTemporal calibration

Quentin Herau, Nathan Piasco, Moussab Bennehar +5

With the recent advances in autonomous driving and the decreasing cost of LiDARs, the use of multimodal sensor systems is on the rise. However, in order to make use of the informat…

cs.CV2022★ 4 cited

SynWoodScape: Synthetic Surround-view Fisheye Camera Dataset for Autonomous Driving

Ahmed Rida Sekkat, Yohan Dupuis, Varun Ravi Kumar +4

Surround-view cameras are a primary sensor for automated driving, used for near-field perception. It is one of the most commonly used sensors in commercial vehicles primarily used…

math.NT2020★ 1 cited

Genus 3 hyperelliptic curves with CM via Shimura Reciprocity

B. Dina, S. Ionica

Up to isomorphism over C, every simple principally polarized abelian variety of dimension 3 is the Jacobian of a smooth projective curve of genus 3. Furthermore, this curve is eith…

cs.CR2020★ 3 cited

Parity (XOR) Reasoning for the Index Calculus Attack

Monika Trimoska, Sorina Ionica, Gilles Dequen

Cryptographic problems can often be reduced to solving Boolean polynomial systems, whose equivalent logical formulas can be treated using SAT solvers. Given the algebraic nature of…

cs.CV2018★ 1 cited

3D model silhouette-based tracking in depth images for puppet suit dynamic video-mapping

Guillaume Caron, Mounya Belghiti, Anthony Dessaux

Video-mapping is the process of coherent video-projection of images, animations or movies on static objects or buildings for shows. This paper focuses on the dynamic video-mapping…

cs.AI2018

Clause Vivification by Unit Propagation in CDCL SAT Solvers

Chu-Min Li, Fan Xiao, Mao Luo +3

Original and learnt clauses in Conflict-Driven Clause Learning (CDCL) SAT solvers often contain redundant literals. This may have a negative impact on performance because redundant…

math.NT2018★ 7 cited

Modular invariants for genus 3 hyperelliptic curves

Sorina Ionica, Pinar Kilicer, Kristin Lauter +4

In this article we prove an analogue of a theorem of Lachaud, Ritzenthaler, and Zykin, which allows us to connect invariants of binary oc-tics to Siegel modular forms of genus 3. W…

cs.DS2016★ 2 cited

Impact of Knowledge on Election Time in Anonymous Networks

Yoann Dieudonné, Andrzej Pelc

Leader election is one of the basic problems in distributed computing. For anonymous networks, the task of leader election is formulated as follows: every node v of the network mus…

math.NT2016★ 24 cited

Constructing genus 3 hyperelliptic Jacobians with CM

Jennifer S. Balakrishnan, Sorina Ionica, Kristin Lauter +1

Given a sextic CM field , we give an explicit method for finding all genus 3 hyperelliptic curves defined over whose Jacobians are simple and have complex multiplic…

cs.DS2014★ 16 cited

Rendezvous in Networks in Spite of Delay Faults

Jérémie Chalopin, Yoann Dieudonné, Arnaud Labourel +1

Two mobile agents, starting from different nodes of an unknown network, have to meet at the same node. Agents move in synchronous rounds using a deterministic algorithm. Each agent…

cs.DM2013

On Quasiperiodic Morphisms

Florence Levé, Gwénaël Richomme

Weakly and strongly quasiperiodic morphisms are tools introduced to study quasiperiodic words. Formally they map respectively at least one or any non-quasiperiodic word to a quasip…

cs.DS2013★ 18 cited

How to Meet Asynchronously at Polynomial Cost

Yoann Dieudonné, Andrzej Pelc, Vincent Villain

Two mobile agents starting at different nodes of an unknown network have to meet. This task is known in the literature as rendezvous. Each agent has a different label which is a po…

cs.DS2011★ 6 cited

Anonymous Meeting in Networks

Yoann Dieudonné, Andrzej Pelc

A team consisting of an unknown number of mobile agents, starting from different nodes of an unknown network, possibly at different times, have to meet at the same node. Agents are…

cs.DC2011★ 2 cited

Optimal grid exploration by asynchronous oblivious robots

Stéphane Devismes, Anissa Lamani, Franck Petit +2

We consider a team of {\em autonomous weak robots} that are endowed with visibility sensors and motion actuators. Autonomous means that the team cannot rely on any kind of central…

math.CO2009★ 36 cited

Balance and Abelian complexity of the Tribonacci word

Gwénaël Richomme, Kalle Saari, Luca Q. Zamboni

G. Rauzy showed that the Tribonacci minimal subshift generated by the morphism is measure-theoretically conjugate to an exchange of thr…

cs.DC2009★ 4 cited

Leader Election Problem Versus Pattern Formation Problem

Yoann Dieudonné, Franck Petit, Vincent Villain

Leader election and arbitrary pattern formation are funda- mental tasks for a set of autonomous mobile robots. The former consists in distinguishing a unique robot, called the lead…

math.CO2008★ 16 cited

Quasiperiodic and Lyndon episturmian words

Amy Glen, Florence Levé, Gwénaël Richomme

Recently the second two authors characterized quasiperiodic Sturmian words, proving that a Sturmian word is non-quasiperiodic if and only if it is an infinite Lyndon word. Here we…

cs.DM2008★ 14 cited

Directive words of episturmian words: equivalences and normalization

Amy Glen, Florence Levé, Gwénaël Richomme

Episturmian morphisms constitute a powerful tool to study episturmian words. Indeed, any episturmian word can be infinitely decomposed over the set of pure episturmian morphisms. T…

astro-ph2002

A Survey Searching for the Epoch of Assembling of Hubble Types

Duilia F. de Mello, Anna Pasquali

We have started a survey of galaxies at intermediate redshifts using the HST-STIS parallel fields. Our main goal is to analyse the morphology of faint galaxies in order to estimate…

astro-ph2002

The Nature of Submm-Detected Galaxies

Duilia de Mello, T. Wiklind, C. Leitherer +1

We present high resolution VLT spectra of 2 submm-detected galaxies. Diagnostic stellar absorption lines (Starburst99) are used to analyse their stellar population. SMM J14011+0252…