A Subband Adaptive Iterative Shrinkage/Thresholding Algorithm
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.
In this paper we view the possibilities to lance a multiple (iterative) birthday attack on NTRU. Recently Wagner's algorithm for the generalized birthday problem (Wagner, 2002) allowed to speed-up several combinatorial attacks. However, in the case of NTRU ...
Insticc-Inst Syst Technologies Information Control & Communication, Avenida D Manuel L, 27A 2 Esquerdo, Setubal, 2910-595, Portugal2008
This paper presents a method for measurement-system design through criteria related to model based structural identification. Using a multi-model approach and results from previous research carried out at EPFL, an improved algorithm is proposed. The algori ...
Composability and deadlock-freedom are important properties that are stated for transactional memory (TM). Commonly, the Semantics of TM requires linearization of transactions. It turns out that linearization of transactions that have cyclic communication ...
Many atomic broadcast algorithms have been published in the last twenty years. Token based algorithms represent a large class of these algorithms. Interestingly, all the token based atomic broadcast algorithms rely on a group membership service and none of ...
This paper presents an efficient adaptive combination strategy for diffusion algorithms over adaptive networks in order to improve the robustness against the spatial variation of SNR over the network. The diffusion least-mean square (LMS) algorithm with th ...
We consider the problem of detecting and locating buried land mines and subsurface objects by using a maneuvering array that receives scattered seismic surface waves. We demonstrate an adaptive system that moves an array of receivers according to an optima ...
Institute of Electrical and Electronics Engineers2007
A new version of the weighted averages (WA) algorithm, called generalized WA, is introduced. Generalized WA exhibit a more compact formulation, devoid of iterative and recursive steps, and a wider range of applications. It is more robust, as it provides a ...
We consider the problem of designing controllers for nonholonomic mobile robots converging to the source (minimum) of a field. In addition to the mobility constraints posed by the nonholonomic dynamics, we assume that the field is completely unknown to the ...
In this work, we propose a new grid conversion algorithm between the hexagonal lattice and the orthogonal (a.k.a. Cartesian) lattice. The conversion process, named H2 O, is easy to implement and is perfectly reversible using the same algorithm to ...
In this research, two crucial optimization problems of berth allocation and yard assignment in the context of bulk ports are studied. We discuss how these problems are interrelated and can be combined and solved as a single large scale optimization problem ...
