Publications related to Sensing the real world

On compact representations of Voronoi cells of lattices

Matthias Schymura, Christoph Hunkenschröder

In a seminal work, Micciancio & Voulgaris (2010) described a deterministic single-exponential time algorithm for the Closest Vector Problem (CVP) on lattices. It is based on the computation of the Voronoi cell of the given lattice and thus may need exponen ...

SPRINGER INTERNATIONAL PUBLISHING AG2018

Indiscreet logarithms in finite fields of small characteristic

Robert Granger, Thorsten Kleinjung, Jens Markus Zumbrägel

Recently, several striking advances have taken place regarding the discrete logarithm problem (DLP) in finite fields of small characteristic, despite progress having remained essentially static for nearly thirty years, with the best known algorithms being ...

2018

SAT-Based Area Recovery in Structural Technology Mapping

Bruno Schmitt Antunes

This paper proposes a fast SAT-based algorithm for recovering area applicable to an already technology mapped circuit. The algorithm considers a sequence of relatively small overlapping regions, called windows, in a mapped network and tries to improve the ...

ASSOC COMPUTING MACHINERY2018

Proactive Synthesis of Recursive Tree-to-String Functions from Examples

Viktor Kuncak, Mikaël Mayer, Jad Hamza

Synthesis from examples enables non-expert users to generate programs by specifying examples of their behavior. A domain-specific form of such synthesis has been recently deployed in a widely used spreadsheet software product. In this paper we contribute t ...

2017

Combinatorial Algorithm for Restricted Max-Min Fair Allocation

Ola Nils Anders Svensson, Christos Kalaitzis, Chidambaram Annamalai

We study the basic allocation problem of assigning resources to players to maximize fairness. This is one of the few natural problems that enjoys the intriguing status of having a better estimation algorithm than approximation algorithm. Indeed, a certain ...

Association for Computing Machinery2017

Towards Generalized FRI Sampling with an Application to Source Resolution in Radioastronomy

Martin Vetterli, Thierry Blu, Hanjie Pan

It is a classic problem to estimate continuous-time sparse signals, like point sources in a direction-of-arrival problem, or pulses in a time-of-flight measurement. The earliest occurrence is the estimation of sinusoids in time series using Prony's method. ...

Institute of Electrical and Electronics Engineers2017

LEAP: Looking beyond pixels with continuous-space EstimAtion of Point sources

Martin Vetterli, Paul Hurley, Thierry Blu, Matthieu Martin Jean-André Simeoni, Hanjie Pan

Context. Two main classes of imaging algorithms have emerged in radio interferometry: the CLEAN algorithm and its multiple variants, and compressed-sensing inspired methods. They are both discrete in nature, and estimate source locations and intensities on ...

2017

Sparse inverse problems for Fourier imaging

Anna Auria Rasclosa

Many natural images have low intrinsic dimension (a.k.a. sparse), meaning that they can be represented with very few coefficients when expressed in an adequate domain. The recent theory of Compressed Sensing exploits this property offering a powerful frame ...

EPFL2017

Robust Submodular Maximization: A Non-Uniform Partitioning Approach

Volkan Cevher, Jonathan Mark Scarlett, Ilija Bogunovic, Slobodan Mitrovic

We study the problem of maximizing a monotone submodular function subject to a cardinality constraint

k

, with the added twist that a number of items

\tau

from the returned set may be removed. We focus on the worst-case setting considered in Orlin et al ...

2017

Streaming Robust Submodular Maximization: A Partitioned Thresholding Approach

Volkan Cevher, Ilija Bogunovic, Slobodan Mitrovic, Ashkan Norouzi Fard, Jakub Tarnawski

We study the classical problem of maximizing a monotone submodular function subject to a cardinality constraint k, with two additional twists: (i) elements arrive in a streaming fashion and (ii) m items from the algorithm’s memory might be removed after th ...

2017

Sensing the real world

Graph Chatbot

Chat with Graph Search

On compact representations of Voronoi cells of lattices

Indiscreet logarithms in finite fields of small characteristic

SAT-Based Area Recovery in Structural Technology Mapping

Proactive Synthesis of Recursive Tree-to-String Functions from Examples

Combinatorial Algorithm for Restricted Max-Min Fair Allocation

Towards Generalized FRI Sampling with an Application to Source Resolution in Radioastronomy

LEAP: Looking beyond pixels with continuous-space EstimAtion of Point sources

Sparse inverse problems for Fourier imaging

Robust Submodular Maximization: A Non-Uniform Partitioning Approach

Streaming Robust Submodular Maximization: A Partitioned Thresholding Approach

SAT-Based Area Recovery in Structural Technology Mapping

Towards Generalized FRI Sampling with an Application to Source Resolution in Radioastronomy

LEAP: Looking beyond pixels with continuous-space EstimAtion of Point sources

Sparse inverse problems for Fourier imaging

Robust Submodular Maximization: A Non-Uniform Partitioning Approach

Streaming Robust Submodular Maximization: A Partitioned Thresholding Approach

On compact representations of Voronoi cells of lattices

Indiscreet logarithms in finite fields of small characteristic

Proactive Synthesis of Recursive Tree-to-String Functions from Examples

Combinatorial Algorithm for Restricted Max-Min Fair Allocation