Publications associées (48)

Ontology-based Knowledge Representation for Traditional Martial Arts

Sarah Irene Brutton Kenderdine, Yumeng Hou

Traditional martial arts are treasures of humanity's knowledge and critical carriers of sociocultural memories throughout history. However, such treasured practices have encountered various challenges in knowledge transmission and now feature many entries ...
2024

Stripping the Swiss discount curve using kernel ridge regression

Damir Filipovic

We analyze and implement the kernel ridge regression (KR) method developed in Filipovic et al. (Stripping the discount curve-a robust machine learning approach. Swiss Finance Institute Research Paper No. 22-24. SSRN. https://ssrn.com/abstract=4058150, 2022 ...
Springer Heidelberg2024

Martial Arts MAsters Knowledge Graph (MA2KG) dataset release

Yumeng Hou

Releasing the Martial Arts MAsters Knowledge Graph (MA2KG) dataset, including the core ontologies and RDF dataset, accompanied with scripts for developing the Martial Art MAsters Knowledge Graph (MA2KG). ...
EPFL Infoscience2023

Brokering between tenants for an international materials acceleration platform

Giovanni Pizzi, Ivano Eligio Castelli, Francisco Fernando Ramirez

The efficient utilization of resources in accelerated materials science necessitates flexible, reconfigurable software-defined research workflows. We demonstrate a brokering approach to modular and asynchronous research orchestration to integrate multiple ...
CELL PRESS2023

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

Synthesis of branching morphologies

Henry Markram, Lida Kanari

Methods, systems, and apparatus, including computer programs encoded on a computer storage medium for generating model neurons. In one aspect, a method includes receiving a plurality of descriptions of branches of dendrites of one or more neurons and gener ...
2021

Towards Weakly Supervised Acoustic Subword Unit Discovery and Lexicon Development Using Hidden Markov Models

Ramya Rasipuram, Marzieh Razavi

Developing a phonetic lexicon for a language requires linguistic knowledge as well as human effort, which may not be available, particularly for under-resourced languages. An alternative to development of a phonetic lexicon is to automatically derive subwo ...
Idiap2017

Constraint-Flow Nets: A Model for Building Constraints from Resource Dependencies

Simon Bliudze, Alena Simalatsar, Alina Zolotukhina

The major research in the resource management literature focuses primarily on two complementary sub-problems: (1) specification languages for formulating resource requests and (2) constraint problems modelling allocation and scheduling. Both directions ass ...
Springer International Publishing2017

Toward Semantic Sensor Data Archives on the Web

Karl Aberer, Jean Paul Calbimonte Perez

Sensor datasets on the Web are becoming increasingly available, and there is a need for making them discoverable and accessible, so that they can be reused despite their heterogeneity. While RDF and Linked Data provide fundamental principles for sharing da ...
2016

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.