Concept

Extended precision

Publications associées (147)

Resolution of Nested Neuronal Representations Can Be Exponential in the Number of Neurons

Collective computation is typically polynomial in the number of computational elements, such as transistors or neurons, whether one considers the storage capacity of a memory device or the number of floating-point operations per second of a CPU. However, w ...

2012

BRIEF: Computing a Local Binary Descriptor Very Fast

Pascal Fua, Vincent Lepetit, Christoph Strecha, Michael Calonder, Tomasz Piotr Trzcinski, Mustafa Özuysal

Binary descriptors are becoming increasingly popular as a means to compare feature points very fast and while requiring comparatively small amounts of memory. The typical approach to creating them is to first compute floating-point ones, using an algorithm ...

Institute of Electrical and Electronics Engineers2012

Thick Boundaries in Binary Space and Their Influence on Nearest-Neighbor Search

Pascal Fua, Vincent Lepetit, Tomasz Piotr Trzcinski

Binary descriptors allow faster similarity computation than real-valued ones while requiring much less storage. As a result, many algorithms have recently been proposed to binarize ﬂoating-point descriptors so that they can be searched for quickly. Unfortu ...

Elsevier2012

Automatically calibrating the viewing direction of optic-flow sensors

Dario Floreano, Jean-Christophe Zufferey, Adrien Briod

Because of their low weight, cost and energy consumption, optic-flow sensors attract growing interest in robotics for tasks such as self-motion estimation or depth measurement. Most applications require a large number of these sensors, which involves a fai ...

IEEE2012

On Secure and Precise IR-UWB Ranging

Jean-Yves Le Boudec, Jean-Pierre Hubaux, Panagiotis Papadimitratos, Marcin Poturalski, Manuel Flury

To provide high ranging precision in multipath environments, a ranging protocol should find the first arriving path, rather than the strongest path. We demonstrate a new attack vector that disrupts such precise Time-of-Arrival (ToA) estimation, and allows ...

Institute of Electrical and Electronics Engineers2012

Coding and Decoding with Adapting Neurons: A Population Approach to the Peri-Stimulus Time Histogram

Wulfram Gerstner, Richard Naud

The response of a neuron to a time-dependent stimulus, as measured in a Peri-Stimulus-Time-Histogram (PSTH), exhibits an intricate temporal structure that reflects potential temporal coding principles. Here we analyze the encoding and decoding of PSTHs for ...

Public Library of Science2012

HW-SW Implementation of a Decoupled FPU for ARM-based Cortex-M1 SoCs in FPGAs

Giovanni De Micheli, Jaime Joven Murillo

Nowadays industrial monoprocessor and multipro- cessor systems make use of hardware floating-point units (FPUs) to provide software acceleration and better precision due to the necessity to compute complex software applications. This paper presents the des ...

2011

Efficient use of accessibility in microRNA target prediction

Jiri Vanicek, Ray Marcel Marin Florez

Considering accessibility of the 3'UTR is believed to increase the precision of microRNA target predictions. We show that, contrary to common belief, ranking by the hybridization energy or by the sum of the opening and hybridization energies, used in curre ...

Oxford University Press2011

Trustworthy Numerical Computation in Scala

Viktor Kuncak, Eva Darulova

Modern computing has adopted the floating point type as a default way to describe computations with real numbers. Thanks to dedicated hardware support, such computations are efficient on modern architectures. However, rigorous reasoning about the resulting ...

2011

A mixed-precision algorithm for the solution of Lyapunov equations on hybrid CPU-GPU platforms

Daniel Kressner

We describe a hybrid Lyapunov solver based on the matrix sign function, where the intensive parts of the computation are accelerated using a graphics processor (GPU) while executing the remaining operations on a general-purpose multi-core processor (CPU). ...

2011

Graph Chatbot

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.

Connectez-vous pour utiliser Chat avec Graph Search