Concept

Dictionnaire

Publications associées (112)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

The Current State of the OBI DICT Project: A Bilingual e-Dictionary of Oracle-Bone Inscriptions with AI Image Recognition

This article reports on the current state of the OBI DICT project, a bilingual e-dictionary of oracle-bone inscriptions (OBI), incorporating artificial intelligence (AI) image recognition technology. It first provides a brief overview of the development of ...

Buro Van Die Wat2024

How We Use Wikipedia: Studying Readers' Behavior with Navigation Traces

Tiziano Piccardi

In the information age, the Web and the growing global connectivity drastically simplified our access to information. Learning and fact-checking from online resources is nowadays part of our daily routine. Studying the dynamic associated with online conten ...

EPFL2022

, , ,

Implicit neural representations (INRs) have recently emerged as a promising alternative to classical discretized representations of signals. Nevertheless, despite their practical success, we still do not understand how INRs represent signals. We propose a ...

IEEE COMPUTER SOC2022

Constrained Language Models for Interactive Poem Generation

Andrei Popescu-Belis, Gabriel Luthier, Aris Xanthos, Simon Mattei

This paper describes a system for interactive poem generation, which combines neural language models (LMs) for poem generation with explicit constraints that can be set by users on form, topic, emotion, and rhyming scheme. LMs cannot learn such constraints ...

EUROPEAN LANGUAGE RESOURCES ASSOC-ELRA2022

Characterization of Real-World Power System Signals in Non-Stationary Conditions using a Dictionary Approach

Mario Paolone, Asja Derviskadic, Guglielmo Frigo, Alexandra Cameron Karpilow

As power grids transition towards low-inertia net-works based on converter-interfaced renewable energy resources, they become increasingly vulnerable to extreme dynamics. Currently, the most advanced methods for signal processing in power systems are embed ...

IEEE2021

Most of the Natural Language Processing (NLP) algorithms involve use of distributed vector representations of linguistic units (primarily words and sentences) also known as embeddings in one way or another. These embeddings come in two flavours namely, sta ...

EPFL2021

Dictionary Learning for Two-Dimensional Kendall Shapes

Michaël Unser, Julien René Pierre Fageot, Virginie Sophie Uhlmann, Anna You-Lai Song

We propose a novel sparse dictionary learning method for planar shapes in the sense of Kendall, namely configurations of landmarks in the plane considered up to similitudes. Our shape dictionary method provides a good trade-off between algorithmic simplici ...

SIAM PUBLICATIONS2020

, ,

In this paper, we propose a novel Deep Micro-Dictionary Learning and Coding Network (DDLCN). DDLCN has most of the standard deep learning layers (pooling, fully, connected, input/output, etc.) but the main difference is that the fundamental convolutional l ...

IEEE2019

B-Spline-Based Exact Discretization of Continuous-Domain Inverse Problems With Generalized TV Regularization

Michaël Unser, Julien René Pierre Fageot, Harshit Gupta, Thomas Jean Debarre

We study continuous-domain linear inverse problems with generalized total-variation (gTV) regularization, expressed in terms of a regularization operator L. It has recently been proved that such inverse problems have sparse spline solutions, with fewer jum ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2019

A nonnegative matrix factorization (NMF) can be computed efficiently under the separability assumption, which asserts that all the columns of the given input data matrix belong to the cone generated by a (small) subset of them. The provably most robust met ...

Ieee-Inst Electrical Electronics Engineers Inc2018