Randomized recovery for boolean compressed sensing

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.

Cutting plane methods are a fundamental approach for solving integer linear programs (ILPs). In each iteration of such methods, additional linear constraints (cuts) are introduced to the constraint set with the aim of excluding the previous fractional opti ...

This paper offers a new algorithm to efficiently optimize scheduling decisions for dial-a-ride problems (DARPs), including problem variants considering electric and autonomous vehicles (e-ADARPs). The scheduling heuristic, based on linear programming theor ...

In light of the challenges posed by climate change and the goals of the Paris Agreement, electricity generation is shifting to a more renewable and decentralized pattern, while the operation of systems like buildings is increasingly electrified. This calls ...

An integer linear program is a problem of the form max{c^T x : Ax=b, x >= 0, x integer}, where A is in Z^(n x m), b in Z^m, and c in Z^n. Solving an integer linear program is NP-hard in general, but there are several assumptions for which it becomes fixed ...

Group testing is a technique that can reduce the number of tests needed to identify infected members in a population, by pooling together multiple diagnostic samples. Despite the variety and importance of prior results, traditional work on group testing ha ...

Time-sensitive networks, as in the context of IEEE Time-Sensitive Networking (TSN) and IETF Deterministic Networking (DetNet), offer deterministic services with guaranteed bounded latency in order to support safety-critical applications. In this thesis, we ...

Masonry buildings form building aggregates around the world in historical centers, which developed as the layout of the city or village densified. In these aggregates, adjacent buildings can share structural walls, connected at the interfaces by interlocki ...

The decentralisation and unpredictability of new renewable energy sources require rethinking our energy system. Data-driven approaches, such as reinforcement learning (RL), have emerged as new control strategies for operating these systems, but they have n ...

The plastic deformation of small-scale face-centered cubic metals exhibits intermittent slip burst events that appear on stress-strain curves as sudden strain jumps and/or load drops. These events are generally attributed to the avalanche-like cooperative ...

In this paper, we present a spatial branch and bound algorithm to tackle the continuous pricing problem, where demand is captured by an advanced discrete choice model (DCM). Advanced DCMs, like mixed logit or latent class models, are capable of modeling de ...

Omnichannel retail has emerged as the new standard in today's commerce landscape, with retailers integrating their physical and online channels to enhance the customer shopping experience. However, such integration presents significant challenges for retai ...

Witness encryption is a cryptographic primitive which encrypts a message under an instance of an NP language and decrypts the ciphertext using a witness associated with that instance. In the current state of the art, most of the witness encryption construc ...

A graph H is a minor of a second graph G if G can be transformed into H by two operations: 1) deleting nodes and/or edges, or 2) contracting edges. Coarse-grained reconfigurable array (CGRA) application mapping is closely related to the graph minor problem ...

Minimising the longest travel distance for a group of mobile robots with interchangeable goals requires knowledge of the shortest length paths between all robots and goal destinations. Determining the exact length of the shortest paths in an environment wi ...

In this thesis, we give new approximation algorithms for some NP-hard problems arising in resource allocation and network design. As a resource allocation problem, we study the Santa Claus problem (also known as the MaxMin Fair Allocation problem) in which ...

We consider fundamental algorithmic number theoretic problems and their relation to a class of block structured Integer Linear Programs (ILPs) called 2-stage stochastic. A 2-stage stochastic ILP is an integer program of the form min{c(T)x vertical bar Ax = ...

In this paper, we formulate a mixed integer linear program (MILP) for the simulated maximum likelihood estimation (MLSE) problem and devise a Benders decomposition approach to speed up the solution process. This framework can be applied to any advanced dis ...

The substitution of portland clinker by supplementary cementitious materials (SCMs) is one of the main avenues for the further decarbonization of cement production. To secure future SCM supplies, generic and performance-related test methods for SCMs are re ...

Making assortment decisions is becoming an increasingly difficult task for many retailers worldwide as they implement omnichannel initiatives. Discrete choice modeling lies at the core of this challenge, yet existing models do not sufficiently account for ...

How can we discern whether the covariance operator of a stochastic pro-cess is of reduced rank, and if so, what its precise rank is? And how can we do so at a given level of confidence? This question is central to a great deal of methods for functional dat ...

Randomized recovery for boolean compressed sensing

Chat with Graph Search

Learning to Remove Cuts in Integer Linear Programming

A ride time-oriented scheduling algorithm for dial-a-ride problems

Quantifying the Unknown: Data-Driven Approaches and Applications in Energy Systems

Results on Sparse Integer Programming and Geometric Independent Sets

Community-Aware Group Testing

Worst-Case Delay Analysis of Time-Sensitive Networks with Network Calculus

Seismic Testing of Adjacent Interacting Masonry Structures

Reinforcement Learning for Joint Design and Control of Battery-PV Systems

On the slip burst amplitude cutoff in dislocation-rich microcrystals

A Spatial Branch and Bound Algorithm for Continuous Pricing with Advanced Discrete Choice Demand Modeling

Quantitative Methods for Omnichannel Decision-Making

Extractable Witness Encryption for the Homogeneous Linear Equations Problem

GRAMM: Fast CGRA Application Mapping Based on A Heuristic for Finding Graph Minors

Certification of Bottleneck Task Assignment With Shortest Path Criteria

Approximation Algorithms for Allocation and Network Design

The double exponential runtime is tight for 2-stage stochastic ILPs

A Benders decomposition for maximum simulated likelihood estimation of advanced discrete choice models

Interlaboratory Test Program to Determine the Precision of the R3 Test Method (ASTM C1897-20) for Measuring Reactivity of Supplementary Cementitious Materials

Assortment optimization using an attraction model in an omnichannel environment

Testing For The Rank Of A Covariance Operator