Publications associées à Algorithm/Architecture Co-Exploration of Visual Computing: Overview and Future Perspectives

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Practicality and time complexity of a sparsified RNA folding algorithm

Philipp Bucher, Slavica Dimitrieva Janeva

Commonly used RNA folding programs compute the minimum free energy structure of a sequence under the pseudoknot exclusion constraint. They are based on Zuker's algorithm which runs in time O(n^3). Recently, it has been claimed that RNA folding can be achie ...

2012

Low Complexity Spectral Analysis of Heart-Rate-Variability through a Wavelet Based FFT

Andreas Peter Burg, Georgios Karakonstantis, Aviinaash Sankaranarayanan

In this paper, a low complexity system for spectral analysis of heart rate variability (HRV) is presented. The main idea of the proposed approach is the implementation of the Fast-Lomb periodogram that is a ubiquitous tool in spectral analysis, using a wav ...

2012

How to Allocate Tasks Asynchronously

Rachid Guerraoui, Seth Gilbert, Dan Alistarh

Asynchronous task allocation is a fundamental problem in distributed computing in which p asynchronous processes must execute a set of m tasks. Also known as write-all or do-all, this problem been studied extensively, both independently and as a key buildi ...

IEEE2012

Generating Fast Indulgent Algorithms

Rachid Guerraoui, Seth Gilbert, Dan Alistarh

Synchronous distributed algorithms are easier to design and prove correct than algorithms that tolerate asynchrony. Yet, in the real world, networks experience asynchrony and other timing anomalies. In this paper, we address the question of how to efficien ...

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

On the Construction of Polar Codes

Emre Telatar, Seyed Hamed Hassani, Ramtin Pedarsani

We consider the problem of efficiently constructing polar codes over binary memoryless symmetric (BMS) channels. The complexity of designing polar codes via an exact evaluation of the polarized channels to find which ones are "good" appears to be exponenti ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2011

On the benefits of vector network coding

Christina Fragouli, Javad Ebrahimi Boroojeni

In vector network coding, the source multi- casts information by transmitting vectors of length L, while intermediate nodes process and combine their incoming packets by multiplying them with L × L coding matrices that play a similar role as coding coeffic ...

2010

A co-design platform for Algorithm/Architecture design exploration

Marco Mattavelli, Christophe Lucarz, Julien Dubois

The efﬁcient implementation of multimedia algorithms, for the ever increasing complexity of the speciﬁcations and the emergence of the new generation of processing platforms characterized by multicore and multicomponent parallel architectures, requires app ...

IEEE2008

A multiple birthday attack on NTRU

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

Algorithm/Architecture Co-Exploration of Visual Computing: Overview and Future Perspectives

Graph Chatbot

Chattez avec Graph Search

Practicality and time complexity of a sparsified RNA folding algorithm

Low Complexity Spectral Analysis of Heart-Rate-Variability through a Wavelet Based FFT

How to Allocate Tasks Asynchronously

Generating Fast Indulgent Algorithms

On the Construction of Polar Codes

A Weighting Scheme for Enhancing Community Detection in Networks

On the benefits of vector network coding

A co-design platform for Algorithm/Architecture design exploration

Abstractions for asynchronous distributed computing with malicious players

A multiple birthday attack on NTRU

On the Construction of Polar Codes

Low Complexity Spectral Analysis of Heart-Rate-Variability through a Wavelet Based FFT

Abstractions for asynchronous distributed computing with malicious players

A Weighting Scheme for Enhancing Community Detection in Networks

A multiple birthday attack on NTRU

Generating Fast Indulgent Algorithms

Practicality and time complexity of a sparsified RNA folding algorithm

On the benefits of vector network coding

A co-design platform for Algorithm/Architecture design exploration

How to Allocate Tasks Asynchronously