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.
In this paper, we revisit the construction of fail-stop signatures from the factoring assumption. These signatures were originally proposed to provide information-theoretic-based security against forgeries. In contrast to classical signature schemes, in wh ...
Simultaneous measurement of multidimensional displacements using digital holographic interferometry involves multi-directional illumination of the deformed object and requires the reliable estimation of the resulting multiple interference phase distributio ...
Optical Society of America2012
State machine replication reduces distributed to centralized computing. Any sequential service, modeled by a state machine, can be replicated over any number of processes and made highly available to all of them. At the heart of this fundamental reduction ...
Springer Berlin Heidelberg2011
The conditional indirect utility of many random utility maximization (RUM) discrete choice models is specified as a sum of an index V depending on observables and an independent random term. In general, the universe of RUM consistent models is much larger, ...
2009
For more than 35 years, the fastest known method for integer multiplication has been the Schonhage-Strassen algorithm running in time O(n log n log log n). Under certain restrictive conditions, there is a corresponding Omega(n log n) lower bound. All this ...
2009
In this paper we present a reconfigurable device which significantly improves the execution time of the most computational intensive functions of three of the most widely used face recognition algorithms; those tasks multiply very large dense matrices. The ...
Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2009
We here propose a novel technique for realizing the multiplication of the pulse repetition rate with a flexibly tunable multiplication factor, based on dynamic Brillouin grating (DBG) reflectors implemented in highly birefringent fibers. ...
We propose a universal and efficient compressive sampling strategy based on the use of a spread spectrum technique. The method essentially consists in a random pre-modulation of the signal of interest followed by projections onto randomly selected vectors ...
We investigate multilevel Schwarz domain decomposition preconditioners, to efficiently solve linear systems arising from numerical discretizations of elliptic partial differential equations by the finite element method. In our analysis we deal with unstruc ...
We introduce the scale axis transform, a new skeletal shape representation for bounded open sets O ⊂ &Rdbl;d. The scale axis transform induces a family of skeletons that captures the important features of a shape in a scale-adaptive way and ...
