Concept

Recherche dichotomique

Publications associées (174)

The Distributed Multiple Voting Problem

Martin Vetterli, Patrick Thiran, Florence Bénézit

A networked set of agents holding binary opinions does not seem to be able to compute its majority opinion by means of local binary interactions only. However, the majority problem can be solved using two or more bits, instead of one [1]. Pairs of agents a ...

2011

Automatic text detection for mobile augmented reality translation

Charles Baur, Marc Petter

We present a fast automatic text detection algorithm devised for a mobile augmented reality (AR) translation system on a mobile phone. In this application, scene text must be detected, recognized, and translated into a desired language, and then the transl ...

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

Identifying clusters as low-lying minima - Efficiency of stochastic and genetic algorithms using inexpensive electronic structure levels

Fabrice Avaltroni

Molecular candidates possessing unconventional chemical bonding paradigms (e.g., boron wheels, molecular stars, and multicenter bonding) have attracted a great deal of attention by the computational community. The viability of such systems is necessarily a ...

Wiley-Blackwell2011

AN INTEGRATED FRAMEWORK FOR MULTI-CHANNEL MULTI-SOURCE LOCALIZATION AND VOICE ACTIVITY DETECTION

Hervé Bourlard, Philip Neil Garner, Afsaneh Asaei, Mohammadjavad Taghizadeh

Two of the major challenges in microphone array based adap- tive beamforming, speech enhancement and distant speech recognition, are robust and accurate source localization and voice activity detection. This paper introduces a spatial gra- dient steered re ...

Idiap2011

An Integrated Framework for Multi-Channel Multi-Source Localization and Voice Activity Detection

Hervé Bourlard, Philip Neil Garner, Afsaneh Asaei, Mohammadjavad Taghizadeh

Two of the major challenges in microphone array based adaptive beamforming, speech enhancement and distant speech recognition, are robust and accurate source localization and voice activity detection. This paper introduces a spatial gradient steered respon ...

2011

A power-efficient, current-mode, binary-tree min / max circuit for Kohonen self-organizing feature maps and nonlinear filters

Rafal Tomasz Dlugosz

A novel current-mode, binary-tree Min / Max circuit for application in analog neural networks and filters has been presented. In the proposed circuit input currents are first converted to step signals with equal amplitudes and different delays that are pro ...

2010

Optimal decision trees for point location in polytopic data sets - application to explicit MPC

Colin Neil Jones

Explicit Model Predictive Control (EMPC) produces control laws defined over a set of polytopic regions in the state space. In this paper we present a method to create a binary search tree for point location in such polytopic sets, in order to provide a fas ...

2010

Low power current-mode binary-tree asynchronous Min/Max circuit

Rafal Tomasz Dlugosz

A novel, current-mode, binary-tree, asynchronous Min/Max circuit for application in nonlinear filters as well as in analog artificial neural networks is proposed. The relatively high precision above 99% can be achieved by eliminating the copying of the inp ...

2010

On the insulator-conductor transition in polymer nanocomposites

Gianluca Ambrosetti

This thesis presents an investigation of the models describing electrical conductivity in polymer nanocomposites, which consist in more or less random dispersions of nanometric conductive fillers like carbon nanotubes, nanofibers or graphene sheets in a po ...

EPFL2010

Mutual information measures for subclass error-correcting output codes classification

Nikolaos Arvanitopoulos Darginis

Error-Correcting Output Codes (ECOCs) reveal a common way to model multi-class classification problems. According to this state of the art technique, a multi-class problem is decomposed into several binary ones. Additionally, on the ECOC framework we can a ...

2010

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