Concept

Congruence relation

Publications associées (33)

Complex Representation Learning with Graph Convolutional Networks for Knowledge Graph Alignment

Thanh Trung Huynh, Quoc Viet Hung Nguyen, Thành Tâm Nguyên

The task of discovering equivalent entities in knowledge graphs (KGs), so-called KG entity alignment, has drawn much attention to overcome the incompleteness problem of KGs. The majority of existing techniques learns the pointwise representations of entiti ...

London2023

Understanding and mitigating resistive losses in fired passivating contacts: role of the interfaces and optimization of the thermal budget

Christophe Ballif, Franz-Josef Haug, Aïcha Hessler-Wyser, Audrey Marie Isabelle Morisset, Julien Hurni, Ezgi Genç, Luca Massimiliano Antognini, Sofia Libraro

This work presents a study of p-type passivating contacts based on SiCx formed via a rapid thermal processing (RTP) step, using conditions compatible with the firing used to sinter screen-printed metallization pastes in industry. The contributions of the t ...

Amsterdam2023

Rational Agreement in the Presence of Crash Faults

Vincent Gramoli, Alejandro Ranchal Pedrosa

Blockchain systems need to solve consensus despite the presence of rational users and failures. The notion of (k, t)-robustness is key to derive impossibility results with k rational players and t faulty players. However, these t faulty players are always ...

IEEE2021

Limitations of the Metasurface Diluted-Slab Model

Karim Achouri, Christophe Caloz

In this article, we investigate the possibility to model a metasurface, defined as a zero-thickness sheet of surface polarization currents and described by generalized sheet transition conditions (GSTCs), by a thin slab with a subwavelength thickness and u ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2020

Scaling-up ESOP Synthesis for Quantum Compilation

Giovanni De Micheli, Mathias Soeken, Bruno Schmitt Antunes

Today's rapid advances in quantum computing hardware call for scalable synthesis methods to map combinational logic represented as multi-level Boolean networks (e.g., an and inverter graph, AIG) to quantum circuits. Such synthesis process must yield revers ...

IEEE2019

Single-step conversion of lignin monomers to phenol: Bridging the gap between lignin and high-value chemicals

Paul Joseph Dyson, Ning Yan

Transformation of lignin into high-value chemicals is hampered by the complexity of monomers obtained from lignin depolymerization. Here we report a strategy, composed of hydro-demethoxylation and de-alkylation reactions, that is able to chemically converg ...

2018

An improvement on the number of simplices in F-q(d)

Van Thang Pham

Let epsilon be a set of points in F-q(d). Bennett et al. (2016) proved that if \epsilon\ >> [GRAHICS] then epsilon determines a positive proportion of all k-simplices. In this paper, we give an improvement of this result in the case when epsilon is the Car ...

Elsevier Science Bv2017

Elliptic curves over a finite field and the trace formula

Ian Nicholas Petrow

We prove formulas for power moments for point counts of elliptic curves over a finite field k such that the groups of k-points of the curves contain a chosen subgroup. These formulas express the moments in terms of traces of Hecke operators for certain con ...

Wiley2017

Heuristic NPN classification for large functions using AIGs and LEXSAT

Giovanni De Micheli, Paolo Ienne, Mathias Soeken, Ana Petkovska

Two Boolean functions are NPN equivalent if one can be ob- tained from the other by negating inputs, permuting inputs, or negating the output. NPN equivalence is an equivalence relation and the number of equivalence classes is significantly smaller than th ...

Springer Int Publishing Ag2016

CM values of higher Green's functions and regularized Petersson products

Maryna Viazovska

Higher Green functions are real-valued functions of two variables on the upper half-plane, which are bi-invariant under the action of a congruence subgroup, have a logarithmic singularity along the diagonal, and satisfy the equation f = k(1−k) f ; here i ...

Cambridge UP2015

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