Concept

Algorithme de Strassen

Publications associées (38)

A Fast Parallel Matrix Multiplication Reconfigurable Unit Utilized In Face Recognitions Systems

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

Faster Integer Multiplication

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

Channel estimation by inference on Gaussian Markov random fields

Thomas Riedl

In this paper, we discuss a novel method for channel estimation. The approach is based on the idea of modeling the complex channel gains by a Markov random field. This graphical model is used to capture the statistical dependencies between consecutive taps ...

2009

Memory-efficient Krylov subspace techniques for solving large-scale Lyapunov equations

Daniel Kressner

This paper considers the solution of large-scale Lyapunov matrix equations of the form AX + XA(T) = -bb(T). The Arnoldi method is a simple but sometimes ineffective approach to deal with such equations. One of its major drawbacks is excessive memory consum ...

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

Discriminative cue integration for medical image annotation

Barbara Caputo, Tatiana Tommasi

Automatic annotation of medical images is an increasingly important tool for physicians in their daily activity. Hospitals nowadays produce an increasing amount of data. Manual annotation is very costly and prone to human mistakes. This paper proposes a mu ...

2008

Discriminative Cue Integration for Medical Image Annotation

Barbara Caputo, Tatiana Tommasi

Automatic annotation of medical images is an increasingly important tool for physicians in their daily activity. Hospitals produce nowadays an increasing amount of data. Manual annotation is very costly and prone to human mistakes. This paper proposes a mu ...

IDIAP2007

Finding near-duplicate web pages: A large-scale evaluation of algorithms

Monika Henzinger

Broder et al.'s [3] shingling algorithm and Charikar's [4] random projection based approach are considered "state-of-the-art" algorithms for finding near-duplicate web pages. Both algorithms were either developed at or used by popular web search engines. W ...

ACM Press2006

Super-resolution from unregistered aliased images

Patrick Vandewalle

Aliasing in images is often considered as a nuisance. Artificial low frequency patterns and jagged edges appear when an image is sampled at a too low frequency. However, aliasing also conveys useful information about the high frequency content of the image ...

EPFL2006

Robust Transmission of H.264/AVC Streams Using Adaptive Group Slicing and Unequal Error Protection

Nikolaos Thomos

We present a novel scheme for the transmission of H.264/AVC video streams over lossy packet networks. The proposed scheme exploits the error-resilient features of H.264/AVC codec and employs Reed-Solomon codes to protect effectively the streams. A novel te ...

2006

Matrix Implementations

Spyridon Pongas

The project consists in the study, implementation and comparison of binary matrix multiplication algorithms in C++. We consider Strassen’s algorithm (which is known to perform well over the real numbers) the Four Russians algorithm (which is designed for b ...

2005

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