Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

Gödel's incompleteness theorems

Related publications (25)

Complex Representation Learning with Graph Convolutional Networks for Knowledge Graph Alignment

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

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 ...

Wiley-Hindawi2023

Extractable Witness Encryption for the Homogeneous Linear Equations Problem

Serge Vaudenay, Bénédikt Minh Dang Tran

Witness encryption is a cryptographic primitive which encrypts a message under an instance of an NP language and decrypts the ciphertext using a witness associated with that instance. In the current state of the art, most of the witness encryption construc ...

Springer2023

An Equivalence Between Data Poisoning and Byzantine Gradient Attacks

Rachid Guerraoui, Le Nguyen Hoang, Sadegh Farhadkhani, Oscar Jean Olivier Villemaud

To study the resilience of distributed learning, the “Byzantine" literature considers a strong threat model where workers can report arbitrary gradients to the parameter server. Whereas this model helped obtain several fundamental results, it has sometimes ...

PMLR2022

Formula Normalizations in Verification

Viktor Kuncak, Simon Guilloud, Dragana Milovancevic, Mario Bucev

We propose a new approach for normalization and simplification of logical formulas. Our approach is based on algorithms for lattice-like structures. Specifically, we present two efficient algorithms for computing a normal form and deciding the word problem ...

2023

Data-Driven Convergence Prediction of Astrobots Swarms

Denis Gillet, Jean-Paul Richard Kneib, Matin Macktoobian

Astrobots are robotic artifacts whose swarms are used in astrophysical studies to generate the map of the observable universe. These swarms have to be coordinated with respect to various desired observations. Such coordination\footnote{\z{A coordination sa ...

2022

Towards the K(2)-local homotopy groups of Z

Philip Egger

Previously (Adv. Math. 360 (2020) art. id. 106895), we introduced a class (Z) over tilde of 2-local finite spectra and showed that all spectra Z is an element of (Z) over tilde admit a v(2)-self-map of periodicity 1. The aim here is to compute the K(2)-loc ...

GEOMETRY & TOPOLOGY PUBLICATIONS2020

Axiomatic scale theory

Martin Alois Rohrmeier, Daniel Harasim

Scales are a fundamental concept of musical practice around the world. They commonly exhibit symmetry properties that are formally studied using cyclic groups in the field of mathematical scale theory. This paper proposes an axiomatic framework for mathema ...

TAYLOR & FRANCIS LTD2020

Direct FEM-Domain Decomposition Using Convex-to-Concave Spherical Ports for Space Applications

Juan Ramon Mosig, Javier Rubio, Pedro Robustillo Bayon

This letter proposes the application of a hybrid numerical technique to two cases of interest in the space business: the reallocation of radiators and scatters on satellite platforms; and the analysis of antennas for mobile communications. It is based on t ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2020

Real-Time State Estimation and Voltage Stability Assessment of Power Grids: From Theoretical Foundations to Practical Applications

Andreas Martin Kettner

The operators of power distribution systems strive to lower their operational costs and improve the quality of the power service provided to their customers. Furthermore, they are faced with the challenge of accommodating large numbers of Distributed Energ ...

EPFL2019

Sign-Changing Solutions for a Class of Zero Mass Nonlocal Schrodinger Equations

We consider the following class of fractional Schrodinger equations: (-Delta)(alpha)u + V(x)u = K(x)f(u) in R-N, where alpha is an element of (0, 1), N > 2 alpha, (-Delta)(alpha) is the fractional Laplacian, V and K are positive continuous functions which ...

2019

Distributed Transactional Systems Cannot Be Fast

Rachid Guerraoui, Willy Zwaenepoel, Diego Didona, Jingjing Wang, Panagiota Fatourou

We prove that no fully transactional system can provide fast read transactions (including read-only ones that are considered the most frequent in practice). Specifically, to achieve fast read transactions, the system has to give up support of transactions ...

2019

DUCT: An Upper Confidence Bound Approach to Distributed Constraint Optimization Problems

Boi Faltings, Christos Dimitrakakis, Brammert Ottens

We propose a distributed upper confidence bound approach, DUCT, for solving distributed constraint optimization problems. We compare four variants of this approach with a baseline random sampling algorithm, as well as other complete and incomplete algorith ...

Assoc Computing Machinery2017

Fixed Point Property For Universal Lattice On Schatten Classes

The special linear group G = SLn(Z[x(1), ... , x(k)]) (n at least 3 and k finite) is called the universal lattice. Let n be at least 4, and p be any real number in (1, infinity). The main result is the following: any finite index subgroup of G has the fixe ...

American Mathematical Society (AMS)2013

Finite graphs and amenability

Gábor Elek

Hyperfiniteness or amenability of measurable equivalence relations and group actions has been studied for almost fifty years. Recently, unexpected applications of hyperfiniteness were found in computer science in the context of testability of graph propert ...

Academic Press Inc Elsevier Science2012

ElimLin Algorithm Revisited

Serge Vaudenay, Pouyan Sepehrdad, Petr Susil

ElimLin is a simple algorithm for solving polynomial systems of multivariate equations over small finite fields. It was initially proposed as a single tool by Courtois to attack DES. It can reveal some hidden linear equations existing in the ideal generate ...

Springer2012

Towards Complete Reasoning about Axiomatic Specifications

Viktor Kuncak, Swen Jacobs

To support verification of expressive properties of functional programs, we consider algebraic style specifications that may relate multiple user-defined functions, and compare multiple invocations of a function for different arguments. We present decision ...

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2011

Cryptographic Hash Functions in Groups and Provable Properties

Juraj Sarinay

We consider several "provably secure" hash functions that compute simple sums in a well chosen group (G,*). Security properties of such functions provably translate in a natural way to computational problems in G that are simple to define and possibly also ...

EPFL2011

Using Life Cycle Approaches to Enhance the Value of Corporate Environmental Disclosures

Damien Antoine Friot

As the focus of environmental policy and management shifts from cleaner production at the process level towards greener products as a whole, stakeholders ask for transparency throughout the entire value chain. This article assesses the comprehensiveness an ...

2011

Harmonic symmetrization of convex sets and of Finsler structures, with applications to Hilbert geometry

Marc Troyanov

David Hilbert discovered in 1895 an important metric that is canonically associated to any convex domain

\Omega

in the Euclidean (or projective) space. This metric is known to be Finslerian, and the usual proof assumes a certain degree of smoothness of t ...

2009

Subjective evaluation of JPEG XR image compression

Touradj Ebrahimi, Francesca De Simone, Lutz Goldmann

In this paper a procedure for subjective evaluation of the new JPEG XR codec for compression of still pictures is described in details. The new algorithm has been compared to the existing JPEG and JPEG 2000 standards when considering compression of high re ...

2009