Concept

Temps partagé

Publications associées (64)

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

Batch processing for efficient base-band operations in real-time GNSS software receivers

Pierre-André Farine, Cyril Botteron, Marcel Baracchi Frei

Personal Digital Assistants (PDAs) or mobile phones applications are not anymore restricted to multimedia or wireless communications, but have been extended to handle Global Navigation Satellite System (GNSS) functionalities. The new generation of portable ...

Inst Navigation, 815 15Th Th St Nw, Ste 832, Washington, Dc 20005 Usa2010

Cooperative Secret Communication with Artificial Noise in Symmetric Interference Channel

Jingge Zhu

We consider the symmetric Gaussian interference channel where two users try to enhance their secrecy rates in a cooperative manner. Artificial noise is introduced along with useful information. We derive the power control and artificial noise parameter for ...

2010

OpenMP parallelization of the three-dimensional distinct lattice spring model

Jiannong Fang, Liang Sun, Gaofeng Zhao, Jianbo Zhu

This paper presents the OpenMP parallel implementation of the Distinct Lattice Spring Model (DLSM). The motivation of this study is to reduce the computing time and increase the computational capacity of the DLSM code. Firstly, the basic theory of DLSM is ...

Crc Press-Taylor & Francis Group, 6000 Broken Sound Parkway Nw, Ste 300, Boca Raton, Fl 33487-2742 Usa2010

TurboTag: Lookup Filtering to Reduce Coherence Directory Power

Babak Falsafi, Michael Ferdman, Pejman Lotfi Kamran, Daniel Crisan

On-chip coherence directories of today’s multi-core systems are not energy efficient. Coherence directories dissipate a significant fraction of their power on unnecessary lookups when running commercial server and scientific workloads. These workloads have ...

ACM2010

Real-Time ASR from Meetings

Philip Neil Garner, John David Scott Dines, Danil Korchagin, Le Zhang

The AMI(DA) system is a meeting room speech recognition system that has been developed and evaluated in the context of the NIST Rich Text (RT) evaluations. Recently, the ``Distant Access'' requirements of the AMIDA project have necessitated that the system ...

2009

Real-Time ASR from Meetings

Philip Neil Garner, John David Scott Dines, Danil Korchagin, Le Zhang

The AMI(DA) system is a meeting room speech recognition system that has been developed and evaluated in the context of the NIST Rich Text (RT) evaluations. Recently, the "Distant Access" requirements of the AMIDA project have necessitated that the system o ...

Idiap2009

Multi-Agent Adaptive Mechanism Leading to Optimal Real-Time Load Sharing

Max-Olivier Hongler, Olivier Gallay

We propose a new real-time load sharing policy (LSP), which optimally dispatches the incoming workload according to the current availability of the operators. Optimality means here that the global service permanently requires the engagement of a minimum nu ...

2009

Conceptual Synopses of Semantics in Social Networks Sharing Structured Data

We are interested in the problem of data sharing in overlay networks that have a social structure, i.e. participants are linked and exchange data with others w.r.t. the similarity of their data semantics. In this paper we propose a methodology to produce c ...

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2008

Anonymous and Fault-Tolerant Shared-Memory Computing

Rachid Guerraoui, Eric Ruppert

The vast majority of papers on distributed computing assume that processes are assigned unique identifiers before computation begins. But is this assumption necessary? What if processes do not have unique identifiers or do not wish to divulge them for re ...

2007

Anonymous and fault-tolerant shared-memory computing

Rachid Guerraoui, Eric Ruppert

Springer, Springer-Verlag2007