Nonnegative Tucker Decomposition with Beta-divergence for Music Structure Analysis of audio signals

Autor: Axel Marmoret, Florian Voorwinden, Valentin Leplat, Cohen, Jérémy E., Frédéric Bimbot

Publikováno v: GRETSI, XXVIIIème Colloque Francophone de Traitement du Signal et des Images
GRETSI, XXVIIIème Colloque Francophone de Traitement du Signal et des Images, Sep 2022, Nancy, France
HAL

Nonnegative Tucker decomposition (NTD), a tensor decomposition model, has received increased interest in the recent years because of its ability to blindly extract meaningful patterns, in particular in Music Information Retrieval. Nevertheless, exist

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::116daea96f0a84d7fd7b228b4766894b
https://hal.science/hal-03409508

Comparaison d'heuristiques pour le calcul de la distance d'édition entre graphes

Autor: Sébastien Bougleux, David Blumenthal, Luc Brun, Nicolas Boria, Johann Gamper

Publikováno v: The VLDB Journal
The VLDB Journal, Springer, 2020, 29 (1), pp.419-458. ⟨10.1007/s00778-019-00544-1⟩

International audience; Because of its flexibility, intuitiveness, and ex-pressivity, the graph edit distance (GED) is one of the most widely used distance measures for labeled graphs. Since exactly computing GED is NP-hard, over the past years, vari

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a150292897a97d7293d27c7f126eda3b
https://doi.org/10.1007/s00778-019-00544-1

Relaxation-Aware Heuristics for Exact Optimization in Graphical Models

Autor: Fulya Trösser, George Katsirelos, Simon de Givry

Publikováno v: Integration of Constraint Programming, Artificial Intelligence, and Operations Research
CPAIOR 2020: SEVENTEENTH INTERNATIONAL CONFERENCE ON THE INTEGRATION OF CONSTRAINT PROGRAMMING, ARTIFICIAL INTELLIGENCE, AND OPERATIONS RESEARCH
CPAIOR 2020: SEVENTEENTH INTERNATIONAL CONFERENCE ON THE INTEGRATION OF CONSTRAINT PROGRAMMING, ARTIFICIAL INTELLIGENCE, AND OPERATIONS RESEARCH, Sep 2020, Vienna, Austria. ⟨10.1007/978-3-030-58942-4_31⟩
Integration of Constraint Programming, Artificial Intelligence, and Operations Research ISBN: 9783030589417
CPAIOR

International audience; Exact solvers for optimization problems on graphical models, such as Cost Function Networks and Markov Random Fields, typically use branch-and-bound. The efficiency of the search relies mainly on two factors: the quality of th

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e884ccbf2a197fbc54335bc5567d428b
https://hal.archives-ouvertes.fr/hal-02946565

Fast Optimization with Zeroth-Order Feedback in Distributed, Multi-User MIMO Systems

Autor: Olivier Bilenne, Panayotis Mertikopoulos, Elena Veronica Belmega

Publikováno v: IEEE Transactions on Signal Processing
IEEE Transactions on Signal Processing, 2020, 68, pp.6085-6100. ⟨10.1109/TSP.2020.3029983⟩
IEEE Transactions on Signal Processing, Institute of Electrical and Electronics Engineers, 2020, 68, pp.6085-6100. ⟨10.1109/TSP.2020.3029983⟩

In this paper, we develop a gradient-free optimization methodology for efficient resource allocation in Gaussian MIMO multiple access channels. Our approach combines two main ingredients: (i) an entropic semidefinite optimization based on matrix expo

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::502fdfa907e6d6a53958789aee077d92
https://hal.science/hal-02861460v2/document

CROC: Convex Resolution Of Centroidal dynamics trajectories to provide a feasibility criterion for the multi contact planning problem

Autor: Michel Taix, Steve Tonneau, Pierre Fernbach

Publikováno v: 2018 IEEE/RSJ International Conference on Intelligent Robots and Systems
2018 IEEE/RSJ International Conference on Intelligent Robots and Systems, Oct 2018, Madrid, Spain. 7p., ⟨10.1109/IROS.2018.8593888⟩
Rapport LAAS n° 18065. 2018
IROS

International audience; We present a novel method for computing centroidal dynamic trajectories in multi-contact planning context. With dynamic motion it is necessary to respect kinematic and dynamic constraints during the contact planning step. Veri

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e2298fcbcaed4f97c25652339af212e0
https://hal.science/hal-01726155v3/document