Concept

Algorithmic efficiency

Publications associées (232)

Knowing When to Slide :: Efficient Scheduling for Sliding Window Processing

Karl Aberer, Sebastian Michel, Ali Salehi, Mehdi Riahi

We consider sliding window query execution scheduling in stream processing engines. Sliding windows are an essential building block to limit the query focus at a particular part of the stream, based either on value count or time ranges. These so called sli ...

IEEE Computer Society2009

Implicit-explicit time integration of a high-order particle-in-cell method with hyperbolic divergence cleaning

Jan Sickmann Hesthaven

A high-order implicit-explicit additive Rung-Kutta time integrator is implemented in a particle-in-cell method based on a high-order discontinuous Galerkin Maxwell solver for the simulation of plasmas. The method enforces Gauss law by a hyperbolic divergen ...

Elsevier2009

Towards a Theory of Robust Localization against Malicious Beacon Nodes

Murtuza Jadliwala

Localization in the presence of malicious beacon nodes is an important problem in wireless networks. Although significant progress has been made on this problem, some fundamental theoretical questions still remain unanswered: in the presence of malicious b ...

IEEE Computer Society2008

Bayesian Feature Selection Applied In a P300 Brain- Computer Interface

Touradj Ebrahimi, Jean-Marc Vesin, Ashkan Yazdani, Ulrich Hoffmann

Feature selection is a machine learning technique that has many interesting applications in the area of brain- computer interfaces (BCIs). Here we show how automatic relevance determination (ARD), which is a Bayesian feature selection technique, can be app ...

2008

Successive refinement via broadcast: Optimizing expected distortion of a Gaussian source over a Gaussian fading channel

Suhas Diggavi

We consider the problem of transmitting a Gaussian source on a slowly fading Gaussian channel, subject to the mean-squared error distortion measure. The channel state information is known only at the receiver but not at the transmitter. The source is assum ...

2008

On the Use of Cascade Structure to Correct Impulsive Noise in Multicarrier Systems

We propose a new decoding algorithm based on a cascade structure for impulsive noise correction in multicarrier systems such as Orthogonal Frequency Division Multiplexing (OFDM) based systems. This new cascade structure based algorithm has the advantage to ...

2008

Scrambling for Privacy Protection in Video Surveillance Systems

Touradj Ebrahimi, Frédéric Dufaux

In this paper, we address the problem of privacy protection in video surveillance. We introduce two efficient approaches to conceal Regions of Interest (ROI) based on transform-domain or codestream-domain scrambling. In the first technique, the sign of sel ...

2008

World-set Decompositions: Expressiveness and Efficient Algorithms

Christoph Koch

Uncertain information is commonplace in real-world data management scenarios. The ability to represent large sets of possible instances (worlds) while supporting efficient storage and processing is an important challenge in this context. The recent formali ...

2007

Efficient rotation-discriminative template matching

Touradj Ebrahimi

This paper presents an efficient approach to rotation discriminative template matching. A hierarchical search divided in three steps is proposed. First, gradient magnitude is compared to rapidly localise points with high probability of match. This result i ...

Springer-Verlag2007

Tracking Atoms with Particles for Audio-visual Source Localization

Pierre Vandergheynst, Andrea Cavallaro, Gianluca Monaci, Emilio Maggio

We present a general framework and an efficient algorithm for tracking relevant video structures. The structures to be tracked are implicitly defined by a Matching Pursuit procedure that extracts and ranks the most important image contours. Based on the ra ...

2007

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