Publications related to An online-offline homogenization strategy to solve quasilinear two-scale problems at the cost of one-scale problems

Reach For the Arcs: Reconstructing Surfaces from SDFs via Tangent Points

We introduce an algorithm to reconstruct a mesh from discrete samples of a shape's Signed Distance Function (SDF). A simple geometric reinterpretation of the SDF lets us formulate the problem through a point cloud, from which a surface can be extracted wit ...

2024

Learning-Augmented Dynamic Power Management with Multiple States via New Ski Rental Bounds

Adam Teodor Polak, Marek Elias

We study the online problem of minimizing power consumption in systems with multiple power-saving states. During idle periods of unknown lengths, an algorithm has to choose between power-saving states of different energy consumption and wake-up costs. We d ...

2021

Monogenic Filtering Based Automatic Defect Detection from a Single Fringe Pattern

Pramod Rastogi, Rishikesh Dilip Kulkarni

We propose a fringe analysis algorithm for the automatic detection of defects from a single fringe pattern (FP). Typically, the surface defects exhibit high fringe density areas in the FP. Consequently, high fringe density regions can be utilized as a sign ...

Springer, Cham2019

Delay-Power-Rate-Distortion Optimization of Video Representations for Dynamic Adaptive Streaming

Pascal Frossard, Laura Toni, Chenglin Li

Dynamic adaptive streaming addresses user heterogeneity by providing multiple encoded representations at different rates and/or resolutions for the same video content. For delay-sensitive applications, such as live streaming, there is however a stringent r ...

IEEE2018

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

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

A Distributed Algorithm for Partitioned Robust Submodular Maximization

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

Abstract—In this paper, we consider the problem of maximizing a monotone submodular function subject to a cardinality constraint, with two added twists: The computation is distributed across a number of machines, and we require the solution to be robust ag ...

2017

Decentralized consensus optimization with asynchrony and delays

Ali H. Sayed, Kun Yuan, Tianyu Wu

We propose an asynchronous, decentralized algorithm for consensus optimization. The algorithm runs over a network of agents, where the agents perform local computation and communicate with neighbors. We design the algorithm so that the agents can compute a ...

IEEE2016

Pattern formation with voluminous processes

Alexandre David Olivier Maurer

When a shoal of small fishes notices a predator, they typically change their collective shape and form a specific pattern. They do so efficiently (in parallel) and without collision. This motivates us to design algorithms with similar properties. In this p ...

EPFL2016

Target-based fiber assignment for large survey spectrographs

Jean-Paul Richard Kneib, Laleh Makarem

Next generation massive spectroscopic survey projects have to process a massive amount of targets. The preparation of subsequent observations should be feasible in a reasonable amount of time. We present a fast algorithm for target assignment that scales a ...

Spie-Int Soc Optical Engineering2016

An online-offline homogenization strategy to solve quasilinear two-scale problems at the cost of one-scale problems

Graph Chatbot

Chat with Graph Search

Reach For the Arcs: Reconstructing Surfaces from SDFs via Tangent Points

Learning-Augmented Dynamic Power Management with Multiple States via New Ski Rental Bounds

Monogenic Filtering Based Automatic Defect Detection from a Single Fringe Pattern

Delay-Power-Rate-Distortion Optimization of Video Representations for Dynamic Adaptive Streaming

Streaming Robust Submodular Maximization: A Partitioned Thresholding Approach

Robust Submodular Maximization: A Non-Uniform Partitioning Approach

A Distributed Algorithm for Partitioned Robust Submodular Maximization

Decentralized consensus optimization with asynchrony and delays

Pattern formation with voluminous processes

Target-based fiber assignment for large survey spectrographs

Delay-Power-Rate-Distortion Optimization of Video Representations for Dynamic Adaptive Streaming

Robust Submodular Maximization: A Non-Uniform Partitioning Approach

A Distributed Algorithm for Partitioned Robust Submodular Maximization

Decentralized consensus optimization with asynchrony and delays

Learning-Augmented Dynamic Power Management with Multiple States via New Ski Rental Bounds

Streaming Robust Submodular Maximization: A Partitioned Thresholding Approach

Pattern formation with voluminous processes

Target-based fiber assignment for large survey spectrographs

Reach For the Arcs: Reconstructing Surfaces from SDFs via Tangent Points

Monogenic Filtering Based Automatic Defect Detection from a Single Fringe Pattern