Publication

Tracking Atoms with Particles

Related publications (86)

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.

Distributed Constraint Optimization with Structured Resource Constraints

Boi Faltings, Adrian Petcu

Distributed constraint optimization (DCOP) provides a framework for coordinated decision making by a team of agents. Often, during the decision making, capacity constraints on agents' resource consumption must be taken into account. To address such scenari ...

2009

The scale axis picture show

Mark Pauly

We demonstrate how the scale axis transform can be used to compute a parameterized family of shape skeletons. The skeletons gradually represent only the most important features of a shape, in a scale-adaptive manner. Here a shape O is any bounded open subs ...

2009

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

A Simple Alternative Derivation of the Expectation Correction Algorithm

Bertrand Mesot

The switching linear dynamical system (SLDS) is a popular model in time-series analysis. However, the complexity of inferring the state of the latent variables scales exponentially with the length of the time-series, resulting in many approximation strateg ...

2009

A multiple birthday attack on NTRU

In this paper we view the possibilities to lance a multiple (iterative) birthday attack on NTRU. Recently Wagner's algorithm for the generalized birthday problem (Wagner, 2002) allowed to speed-up several combinatorial attacks. However, in the case of NTRU ...

Insticc-Inst Syst Technologies Information Control & Communication, Avenida D Manuel L, 27A 2 Esquerdo, Setubal, 2910-595, Portugal2008

Multiple Heterogeneous Ant Colonies with Information Exchange

Arash Arami, Bijan Rahimzadeh Rofoee

The method of multiple heterogeneous ant colonies with information exchange (MHACIE) is presented in this paper with emphasis on the speed of finding the optimal solution and the corresponding computational complexity. The proposed method which is inspired ...

2008

A Fast Thresholded Landweber Algorithm for Wavelet-Regularized Multidimensional Deconvolution

Michaël Unser, Cédric René Jean Vonesch

We present a fast variational deconvolution algorithm that minimizes a quadratic data term subject to a regularization on the

\ell ^{ 1 }

-norm of the wavelet coefficients of the solution. Previously available methods have essentially consisted in alte ...

IEEE2008

Segmenting memory colours

Sabine Süsstrunk, Francisco Estrada

Memory colours refer to the colour of specific image classes that have the essential attribute of being perceived in a consistent manner by human observers. In colour correction or rendering tasks, this consistency implies that they have to be faithfully r ...

2008

A co-design platform for Algorithm/Architecture design exploration

Marco Mattavelli, Christophe Lucarz, Julien Dubois

The efﬁcient implementation of multimedia algorithms, for the ever increasing complexity of the speciﬁcations and the emergence of the new generation of processing platforms characterized by multicore and multicomponent parallel architectures, requires app ...

IEEE2008