Publications associées à Computation Of A 30750-Bit Binary Field Discrete Logarithm

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.

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

Adaptive Models for Gene Networks

Ali H. Sayed

Biological systems are often treated as time-invariant by computational models that use fixed parameter values. In this study, we demonstrate that the behavior of the p53-MDM2 gene network in individual cells can be tracked using adaptive filtering algorit ...

Public Library of Science2012

Solving 112-bit prime ECDLP on game consoles using sloppy reduction

Arjen Lenstra, Joppe Willem Bos, Thorsten Kleinjung, Marcelo Kaihara

We describe a cell processor implementation of Pollard’s rho method to solve discrete logarithms in groups of elliptic curves over prime fields. The implementation was used on a cluster of PlayStation 3 game consoles to set a new record. We present in deta ...

2012

A coupled distinct lattice spring model for rock failure under dynamic loads

Jiannong Fang, Jian Zhao, Gaofeng Zhao

It is necessary to take into account the micro discretization of natural rock when studying its macroscopic failure behavior. This requirement has resulted in renewed and increased interest in the discrete or framework/lattice numerical modeling techniques ...

Elsevier2012

MEU – A cartographic-based web-platform for urban energy management and planning

Gaëtan Cherix, Massimiliano Capezzali

This paper presents MEU (http://meu.epfl.ch) project results: a new GIS-centric web application for energy management and planning of existing or new urban zones. The project has been carried out with the collaboration of four Western Switzerland cities an ...

2012

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

Recipes on Hard Thresholding Methods

Volkan Cevher, Anastasios Kyrillidis

Compressive sensing (CS) is a data acquisition and recovery technique for finding sparse solutions to linear inverse problems from sub-Nyquist measurements. CS features a wide range of computationally efficient and robust signal recovery methods, based on ...

2011

The Complexity of Renaming

Rachid Guerraoui, Seth Gilbert, Dan Alistarh

We study the complexity of renaming, a fundamental problem in distributed computing in which a set of processes need to pick distinct names from a given namespace. We prove an individual lower bound of Omega(k) process steps for deterministic renaming into ...

Ieee Computer Soc Press, Customer Service Center, Po Box 3014, 10662 Los Vaqueros Circle, Los Alamitos, Ca 90720-1264 Usa2011

Computation Of A 30750-Bit Binary Field Discrete Logarithm

Graph Chatbot

Chattez avec Graph Search

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

Adaptive Models for Gene Networks

Solving 112-bit prime ECDLP on game consoles using sloppy reduction

A coupled distinct lattice spring model for rock failure under dynamic loads

MEU – A cartographic-based web-platform for urban energy management and planning

Complexity of the critical node problem over trees

On the Construction of Polar Codes

Recipes on Hard Thresholding Methods

The Complexity of Renaming

Sub-Logarithmic Test-and-Set Against a Weak Adversary

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

A coupled distinct lattice spring model for rock failure under dynamic loads

Complexity of the critical node problem over trees

On the Construction of Polar Codes

Recipes on Hard Thresholding Methods

MEU – A cartographic-based web-platform for urban energy management and planning

Solving 112-bit prime ECDLP on game consoles using sloppy reduction

Adaptive Models for Gene Networks

Sub-Logarithmic Test-and-Set Against a Weak Adversary

The Complexity of Renaming