Publication

Review of iterative Fourier-transform algorithms for beam shaping applications

Related publications (49)

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.

Practical algorithms for gathering stored correlated data in a network

Ramin Khalili

Many sensing systems remotely monitor/measure an environment at several sites, and then report these observations to a central site. We propose and investigate several practical algorithms for joint routing and compression of data files as they are forward ...

2008

Subtree-based bounds and simulation-based estimations for the partition function

Mehdi Molkaraie

Many different algorithms developed in statistical physics, coding theory, signal processing, and artificial intelligence can be expressed by graphical models and solved (either exactly or approximately) with iterative message-passing algorithms on the mod ...

EPFL2007

Medial axis approximation from inner Voronoi balls: A demo of the Mesecina tool

Mark Pauly

We illustrate a simple algorithm for approximating the medial axis of a 2D shape with smooth boundary from a sample of this boundary. The algorithm is compared to a more general approximation method that builds on the same idea, namely, to approximate the ...

2007

Performance of Averaging Algorithms in Time-Varying Networks

Patrick Denantes

We study averaging algorithms in time-varying networks, and means tomeasure their performance. We present sufficient conditions on these algorithms, which ensure they lead to computation at each node, of the global average of measurements provided by each ...

2007

Finding near-duplicate web pages: A large-scale evaluation of algorithms

Monika Henzinger

Broder et al.'s [3] shingling algorithm and Charikar's [4] random projection based approach are considered "state-of-the-art" algorithms for finding near-duplicate web pages. Both algorithms were either developed at or used by popular web search engines. W ...

ACM Press2006

Nearly optimal exploration-exploitation decision thresholds

Christos Dimitrakakis

While in general trading off exploration and exploitation in reinforcement learning is hard, under some formulations relatively simple solutions exist. Optimal decision thresholds for the multi-armed bandit problem, one for the infinite horizon discounted ...

2006

Nearly optimal exploration-exploitation decision thresholds

Christos Dimitrakakis

IDIAP2006

Nearly optimal exploration-exploitation decision thresholds

Christos Dimitrakakis

2006

Global mixed-integer dynamic optimization

Benoît Chachuat

Recent advances in process synthesis, design, operations, and control have created an increasing demand for efficient numerical algorithms for optimizing a dynamic system coupled with discrete decisions; these problems are termed mixed-integer dynamic opti ...

2005

On the complexity of fixed parameter clique and dominating set

Friedrich Eisenbrand

We provide simple, faster algorithms for the detection of cliques and dominating sets of fixed order. Our algorithms are based on reductions to rectangular matrix multiplication. We also describe an improved algorithm for diamonds detection. © 2004 Elsevie ...

2004