Publications associées à Quantitative Languages

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Exact Algorithms for $ L ^{ 1 } $ -TV Regularization of Real-Valued or Circle-Valued Signals

Michaël Unser, Martin Kurt Storath

We consider

L ^{ 1 }

-TV regularization of univariate signals with values on the real line or on the unit circle. While the real data space leads to a convex optimization problem, the problem is nonconvex for circle-valued data. In this paper, we deriv ...

SIAM2016

Quantitative Languages

Graph Chatbot

Chattez avec Graph Search

Lower Bounds for Unambiguous Automata via Communication Complexity

ExG Signal Feature Selection Using Hyperdimensional Computing Encoding

Iterative distributed fault detection and isolation for linear systems based on moving horizon estimation

TFHE: Fast Fully Homomorphic Encryption Over the Torus

The Complexity of Splitting Necklaces and Bisecting Ham Sandwiches

Control synthesis for stochastic systems given automata specifications defined by stochastic sets

Optimal Switching Between Cash-Flow Streams

A Comment on “Computational Complexity of Stochastic Programming Problems”

Exact Algorithms for $ L ^{ 1 } $ -TV Regularization of Real-Valued or Circle-Valued Signals

K-Adaptability in Two-Stage Distributionally Robust Binary Programming

Lower Bounds for Unambiguous Automata via Communication Complexity

ExG Signal Feature Selection Using Hyperdimensional Computing Encoding

Control synthesis for stochastic systems given automata specifications defined by stochastic sets

TFHE: Fast Fully Homomorphic Encryption Over the Torus

Iterative distributed fault detection and isolation for linear systems based on moving horizon estimation

K-Adaptability in Two-Stage Distributionally Robust Binary Programming

Exact Algorithms for $ L ^{ 1 } $ -TV Regularization of Real-Valued or Circle-Valued Signals

The Complexity of Splitting Necklaces and Bisecting Ham Sandwiches

Optimal Switching Between Cash-Flow Streams

A Comment on “Computational Complexity of Stochastic Programming Problems”