Publications associées à Stationary Features and Cat Detection

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.

Sublinear Bounds on the Distinguishing Advantage for Multiple Samples

Serge Vaudenay

The maximal achievable advantage of a (computationally unbounded) distinguisher to determine whether a source

Z

is distributed according to distribution

P_0

P_1

, when given access to one sample of

Z

, is characterized by the statistical distance ...

Springer, Cham2020

Stationary Features and Cat Detection

Graph Chatbot

Chattez avec Graph Search

Locally Differentially-Private Randomized Response for Discrete Distribution Learning

Fragility curves for special types of Switzerland buildings

Efficient Parsing with Derivatives and Zippers

Probabilistic Tracklet Scoring and Inpainting for Multiple Object Tracking

Uniform parsing for hyperedge replacement grammars

Sublinear Bounds on the Distinguishing Advantage for Multiple Samples

Distributionally Robust Optimization with Polynomial Densities: Theory, Models and Algorithms

On the probability distribution of the local times of diagonally operator-self-similar Gaussian fields with stationary increments

Regret Minimization and Separation in Multi-Bidder Multi-Item Auctions

Erdos Goes Neural: an Unsupervised Learning Framework for Combinatorial Optimization on Graphs

Locally Differentially-Private Randomized Response for Discrete Distribution Learning

Distributionally Robust Optimization with Polynomial Densities: Theory, Models and Algorithms

Sublinear Bounds on the Distinguishing Advantage for Multiple Samples

Uniform parsing for hyperedge replacement grammars

Probabilistic Tracklet Scoring and Inpainting for Multiple Object Tracking

Fragility curves for special types of Switzerland buildings

Efficient Parsing with Derivatives and Zippers

On the probability distribution of the local times of diagonally operator-self-similar Gaussian fields with stationary increments

Erdos Goes Neural: an Unsupervised Learning Framework for Combinatorial Optimization on Graphs

Regret Minimization and Separation in Multi-Bidder Multi-Item Auctions