Related publications (284)

Using Linked Open Data to Bootstrap a Knowledge Base of Classical Texts

Matteo Romanello

We describe a domain-specific knowledge base aimed at supporting the extraction of bibliographic references in the domain of Classics. In particular, we deal with references to canonical works of the Greek and Latin literature by providing a model that rep ...
CEUR2017

An Inexact Ultra-low Power Bio-signal Processing Architecture With Lightweight Error Recovery

David Atienza Alonso, Giovanni Ansaloni, Ruben Braojos Lopez, Soumya Subhra Basu, Loris Gérard Duch

The energy efficiency of digital architectures is tightly linked to the voltage level (Vdd) at which they operate. Aggressive voltage scaling is therefore mandatory when ultra-low power processing is required. Nonetheless, the lowest admissible Vdd is o‰e ...
2017

The references of references: a method to enrich humanities library catalogs with citation data

Frédéric Kaplan, Matteo Romanello, Giovanni Colavizza

The advent of large-scale citation indexes has greatly impacted the retrieval of scientific information in several domains of research. The humanities have largely remained outside of this shift, despite their increasing reliance on digital means for infor ...
Springer Verlag2017

Communication-aware adaptive parareal with application to a nonlinear hyperbolic system of partial dierential equations

Jan Sickmann Hesthaven, Allan Svejstrup Nielsen, Gilles Brunner

In the strong scaling limit, the performance of conventional spatial domain decomposition techniques for the parallel solution of PDEs saturates. When sub-domains become small, halo-communication and other overheard come to dominate. A potential path beyon ...
2017

Signal coverage approach to the detection probability of hypothetical extraterrestrial emitters in the Milky Way

Claudio Grimaldi

The lack of evidence for the existence of extraterrestrial life, even the simplest forms of animal life, makes it is difficult to decide whether the search for extraterrestrial intelligence (SETI) is more a high-risk, high-payoff endeavor than a futile att ...
Nature Publishing Group2017

Discrete least-squares approximations over optimized downward closed polynomial spaces in arbitrary dimension

Fabio Nobile, Giovanni Migliorati

We analyze the accuracy of the discrete least-squares approximation of a function uu in multivariate polynomial spaces PΛ:=span{yyν:νΛ}P_\Lambda:=span\{y\mapsto y^\nu \,: \, \nu\in \Lambda\} with ΛN0d\Lambda\subset N_0^d over the domain Γ:=[1,1]d\Gamma:=[-1,1]^d, based on the s ...
2017

Graph learning under sparsity priors

Pascal Frossard, Hermina Petric Maretic

Graph signals offer a very generic and natural representation for data that lives on networks or irregular structures. The actual data structure is however often unknown a priori but can sometimes be estimated from the knowledge of the application domain. ...
Ieee2017

The role of the polyglutamine and N-terminal domains in regulating the aggregation and structural properties of Huntingtin Exon 1

Sophie Vieweg

Huntington Disease (HD) is caused by a CAG repeat expansion in the huntingtin gene leading to the formation of mutant Huntingtin protein (Htt) with an expanded polyglutamine (polyQ) domain (>36Q). Generation of short N-terminal Htt fragments by proteolysis ...
EPFL2017

Reconstruction of 3D scattered data via radial basis functions by efficient and robust techniques

Alberto Crivellaro

We propose new algorithms to overcome two of the most constraining limitations of surface reconstruction methods in use. In particular, we focus on the large amount of data characterizing standard acquisitions by scanner and the noise intrinsically introdu ...
Elsevier Science Bv2017

Trustworthy Biometric Verification under Spoofing Attacks

Ivana Chingovska

The need for automation of the identity recognition process for a vast number of applications resulted in great advancement of biometric systems in the recent years. Yet, many studies indicate that these systems suffer from vulnerabilities to spoofing (pre ...
EPFL2016

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.