Concept

Matrix multiplication algorithm

Related publications (170)

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.

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

Graph colouring approaches for a satellite range scheduling problem

Nicolas Zufferey, Patrick Amstutz, Philippe Giaccari

A goal of this paper is to efficiently adapt the best ingredients of the graph colouring techniques to an NP-hard satellite range scheduling problem, called MuRRSP. We propose two new heuristics for the MuRRSP, where as many jobs as possible have to be sch ...

2008

On Locating Byzantine Attackers

Christina Fragouli, Suhas Diggavi, Mahdi Jafari Siavoshani

We examine networks that employ network coding, and are subject to Byzantine attacks. We consider systems where an appropriate network error correcting scheme is employed that is able to correct (up to a certain number of) Byzantine errors. Given this setu ...

2008

Efficient multiplication using type $2$ optimal normal bases

Mohammad Amin Shokrollahi

In this paper we propose a new structure for multiplication using optimal normal bases of type

2

. The multiplier uses an efficient linear transformation to convert the normal basis representations of elements of

F_{q^{n}}

to suitable polynomials of deg ...

2007

Discrete choice models with multiplicative error terms

Michel Bierlaire

The conditional indirect utility of many random utility maximization (RUM) discrete choice models is specified as a sum of an index V depending on observables and an independent random term P. In general, the universe of RUM consistent models is much large ...

2007

High-Resolution EEG Techniques for Brain-Computer Interface Applications

José del Rocio Millán Ruiz

High-resolution electroencephalographic (HREEG) techniques allow estimation of cortical activity based on non-invasive scalp potential measurements, using appropriate models of volume conduction and of neuroelectrical sources. In this study we propose an a ...

2007

Annihilating filter-based decoding in the compressed sensing framework - art. no. 670121

Martin Vetterli, Ali Hormati

Recent results in compressed sensing or compressive sampling suggest that a relatively small set of measurements taken as the inner product with universal random measurement vectors can well represent a source that is sparse in some fixed basis. By adaptin ...

Spie-Int Soc Optical Engineering, Po Box 10, Bellingham, Wa 98227-0010 Usa2007

An Extensible and Personalized Approach to QoS-enabled Service Discovery

Karl Aberer, Manfred Hauswirth

We present an extensible and customizable framework for the autonomous discovery of Semantic Web services based on their QoS properties. Using semantic technologies, users can specify the QoS matching model and customize the ranking of services flexibly ac ...

2007

Refined Quorum Systems

Rachid Guerraoui, Marko Vukolic

It is considered good distributed computing practice to devise object implementations that tolerate contention, periods of asynchrony and a large number of failures, but perform fast if few failures occur, the system is synchronous and there is no contenti ...

2007

Refined Quorum Systems

Rachid Guerraoui, Marko Vukolic

2007

Efficient multiplication using type $2$ optimal normal bases

Mohammad Amin Shokrollahi

In this paper we propose a new structure for multiplication using optimal normal bases of type

2

. The multiplier uses an efficient linear transformation to convert the normal basis representations of elements of

F_{q^{n}}

to suitable polynomials of deg ...

2007