Publication

Key improvements to XTR

Related publications (43)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Universal p'-central extensions

Jacques Thévenaz, Caroline Lassueur

It is well-known that a finite group possesses a universal central extension if and only if it is a perfect group. Similarly, given a prime number p, we show that a finite group possesses a universal p′-central extension if and only if the p′-part of its a ...

Elsevier2017

LPN in Cryptography

Sonia Mihaela Bogos

The security of public-key cryptography relies on well-studied hard problems, problems for which we do not have efficient algorithms. Factorization and discrete logarithm are the two most known and used hard problems. Unfortunately, they can be easily solv ...

EPFL2017

Efficient Public-Key Distance Bounding Protocol

Serge Vaudenay, Handan Kilinç Alper

Distance bounding protocols become more and more important because they are the most accurate solution to defeat relay attacks. They consist of two parties: a verifier and a prover. The prover shows that (s)he is close enough to the verifier. In some appli ...

Springer-Verlag Berlin2016

Multilevel Design Understanding: From Specification to Logic Invited Paper

Mathias Soeken

We present an outline of the field of Multilevel Design Understanding by first defining and motivating the related problems, and then describing the key issues which must be addressed in future research. ...

Assoc Computing Machinery2016

Distributed Policy Evaluation Under Multiple Behavior Strategies

Ali H. Sayed

We apply diffusion strategies to develop a fully-distributed cooperative reinforcement learning algorithm in which agents in a network communicate only with their immediate neighbors to improve predictions about their environment. The algorithm can also be ...

IEEE2015

Optimal polynomial blow up range for critical wave maps

Can Gao

We prove that the critical Wave Maps equation with target

S^2

and origin ℝ

^{2+1}

admits energy class blow up solutions of the form [ u(t, r) = Q(\lambda(t)r) + \epsilon(t, r) ] where

Q:ℝ²\rightarrow S^2

is the ground state harmonic map and $\lambda ...

EPFL2015

FID-guided retrospective motion correction based on autofocusing

Rolf Gruetter, Tobias Kober, Cristina Granziera, Gunnar Krüger

This work investigates the possibility of using FID navigator signals to improve the performance of a recently proposed autofocusing-based retrospective motion correction technique. FID navigators were incorporated into an MP-RAGE sequence and 3 subjects w ...

2014

Light Transport Matrix recovery for nearly planar objects

Martin Vetterli, Paolo Prandoni, Loïc Arnaud Baboulaz, Niranjan Thanikachalam

The light transport matrix has become a powerful tool for scene relighting, owing to the versatility of its representational power of various light transport phenomenon. We argue that scenes with an almost planar surface geometry, even with significant amo ...

SPIE2014

Anatomical Priors to improve Global Tractography

Jean-Philippe Thiran, Alessandro Daducci, Alia Lemkaddem

The main assumption of fiber-tracking algorithms is that fiber trajectories are represented by paths of highest diffusion, which is usually accomplished by following the principal diffusion directions in every voxel. The state-of-the-art approaches known a ...

2014

Efficient Non-malleable Codes and Key-Derivation for Poly-size Tampering Circuits

Sebastian Faust

Non-malleable codes, defined by Dziembowski, Pietrzak and Wichs (ICS ’10), provide roughly the following guarantee: if a codeword c encoding some message x is tampered to c' = f(c) such that c c, then the tampered message x contained in c reveals no inf ...

Springer2014