Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

E (mathematical constant)

Related publications (20)

Differential Entropy of the Conditional Expectation Under Additive Gaussian Noise

Michael Christoph Gastpar, Alper Köse, Ahmet Arda Atalik

The conditional mean is a fundamental and important quantity whose applications include the theories of estimation and rate-distortion. It is also notoriously difficult to work with. This paper establishes novel bounds on the differential entropy of the co ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2022

Local approximation of the Maximum Cut in regular graphs

Etienne Michel François Bamas

This paper is devoted to the distributed complexity of finding an approximation of the maximum cut (MAXCUT) in graphs. A classical algorithm consists in letting each vertex choose its side of the cut uniformly at random. This does not require any communica ...

ELSEVIER2020

Distributionally Robust Mechanism Design

Daniel Kuhn, Wolfram Wiesemann, Cagil Kocyigit

We study a mechanism design problem where an indivisible good is auctioned to multiple bidders, for each of whom it has a private value that is unknown to the seller and the other bidders. The agents perceive the ensemble of all bidder values as a random v ...

2020

Local Approximation of the Maximum Cut in Regular Graphs

Etienne Michel François Bamas

This paper is devoted to the distributed complexity of finding an approximation of the maximum cut in graphs. A classical algorithm consists in letting each vertex choose its side of the cut uniformly at random. This does not require any communication and ...

SPRINGER INTERNATIONAL PUBLISHING AG2019

Using Structural Properties for Integer Programs

Kim-Manuel Klein

Integer programs (IPs) are one of the fundamental tools used to solve combinatorial problems in theory and practice. Understanding the structure of solutions of IPs is thus helpful to argue about the existence of solutions with a certain simple structure, ...

SPRINGER INTERNATIONAL PUBLISHING AG2018

A Framework for the Secretary Problem on the Intersection of Matroids

Ola Nils Anders Svensson, Moran Feldman

The secretary problem became one of the most prominent online selection problems due to its numerous applications in online mechanism design. The task is to select a maximum weight subset of elements subject to given constraints, where elements arrive one- ...

ASSOC COMPUTING MACHINERY2018

A New Framework for Distributed Submodular Maximization

Justin Dean Ward

A wide variety of problems in machine learning, including exemplar clustering, document summarization, and sensor placement, can be cast as constrained submodular maximization problems. A lot of recent effort has been devoted to developing distributed algo ...

Ieee2016

Timescales of N-H bond dissociation in pyrrole: a nonadiabatic dynamics study

Antonio Prlj

The excitation wavelength dependent photodynamics of pyrrole are investigated by nonadiabatic trajectory-surface-hopping dynamics simulations based on time dependent density functional theory (TDDFT) and the algebraic diagrammatic construction method to th ...

Royal Soc Chemistry2015

Learning with tensors: a framework based on convex optimization and spectral regularization

Quoc Tran Dinh

We present a framework based on convex optimization and spectral regularization to perform learning when feature observations are multidimensional arrays (tensors). We give a mathematical characterization of spectral penalties for tensors and analyze a uni ...

Springer2014

Search for neutrino-induced particle showers with IceCube-40

Matthias Wolf, Mark Tobin, Xiaoxia Bai, Mathieu Ribordy, Shirit Cohen

We report on the search for neutrino-induced particle showers, so-called cascades, in the IceCube-40 detector. The data for this search were collected between April 2008 and May 2009 when the first 40 IceCube strings were deployed and operational. Three co ...

American Physical Society2014

Expert Judgements in Risk Analysis: a Strategy to Overcome Uncertainities

Thierry Meyer, Amela Groso, David Nicolas Plüss

There is a need for a risk analysis technique specific for academic research laboratories. Since accurate accident data, normally required for quantitative risk analysis, are not available for this environment, expert judgements are often used to describe ...

2013

Investigating Reliability on Fuel Cell Model Identification. Part I: A Design of Experiments Approach

Jan Van Herle, Daniel Favrat, Leonidas Tsikonis

A model-based Design of Experiments method was employed for the optimisation of measurements on a Solid Oxide Fuel Cell (SOFC). Based on a simplified SOFC model, a variation of the D-optimality was used as optimisation criterion for the calculation of opti ...

2011

Exponential decay and Fredholm properties in second-order quasilinear elliptic systems

Charles Stuart, Hicham Georges Gebran

We consider second-order quasilinear elliptic systems on un-bounded domains in the setting of Sobolev spaces. We complete our earlier work on the Fredholm and properness properties of the associated differential operators by giving verifiable conditions fo ...

2010

Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine Failures

Rachid Guerraoui

We introduce a new theoretical model of ad hoc mobile computing in which agents have severely restricted memory, highly unpredictable movement and no initial knowledge of the system. Each agent’s memory can store O(1) bits, plus a unique identiﬁer, and O(1 ...

2009

Stochastic modelling of prey depletion processes

Anthony Christopher Davison

The modelling of prey-predator interactions is of major importance for the understanding of population dynamics. Classically, these interactions are modelled using ordinary differential equations, but this has the drawbacks of assuming continuous populatio ...

2009

Degenerate crossing numbers

János Pach

Let G be a graph with n vertices and ea parts per thousand yen4n edges, drawn in the plane in such a way that if two or more edges (arcs) share an interior point p, then they properly cross one another at p. It is shown that the number of crossing points, ...

Springer-Verlag2009

EPnP: An Accurate O(n) Solution to the PnP Problem

Pascal Fua, Vincent Lepetit

We propose a non-iterative solution to the PnP problem-the estimation of the pose of a calibrated camera from n 3D-to-2D point correspondences-whose computational complexity grows linearly with n. This is in contrast to state-of-the-art methods that are O( ...

Springer Verlag2009

Efficient Protocols for Set Membership and Range Proofs

Rafik Chaabouni

We consider the following problem: Given a commitment to a value σ, prove in zero-knowledge that σ belongs to some discrete set Φ. The set Φ can perhaps be a list of cities or clubs; often Φ can be a numerical range such as [1, 220]. This problem arises in ...

Springer2008

Virtual Infrastructure for Collision-Prone Wireless Networks

Seth Gilbert

Wireless ad hoc networks pose several significant challenges: devices are unreliable; deployments are unpredictable; and communication is erratic. One proposed solution is Virtual Infrastructure, an abstraction in which unpredictable and unreliable devices ...

2008

Accurate Non-Iterative O(n) Solution to the PnP Problem

Pascal Fua, Vincent Lepetit

We propose a non-iterative solution to the PnP problem---the estimation of the pose of a calibrated camera from n 3D-to-2D point correspondences---whose computational complexity grows linearly with n. This is in contrast to state-of-the-art method that are ...

2007

Related publications (20)