Publication

Upper bounds for Euclidean minima of abelian number fields

Related publications (33)

Graph Chatbot

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.

Approximating the Gaussian multiple description rate region under symmetric distortion constraints

Suhas Diggavi

We consider multiple description coding for the Gaussian source with K descriptions under the symmetric mean squared error distortion constraints. One of the main contributions is a novel lower bound on the sum rate, derived by generalizing Ozarow’s well-k ...

2008

On Properties of the Minimum Entropy Sub-tree to Compute Lower Bounds on the Partition Function

Mehdi Molkaraie

Computing the partition function and the marginals of a global probability distribution are two important issues in any probabilistic inference problem. In a previous work, we presented sub-tree based upper and lower bounds on the partition function of a g ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2008

On the capacity of large Gaussian relay networks

Martin Vetterli, Michael Christoph Gastpar

The capacity of a particular large Gaussian relay network is determined in the limit as the number of relays tends to infinity. Upper bounds are derived from cut-set arguments, and lower bounds follow from an argument involving uncoded transmission. It is ...

Institute of Electrical and Electronics Engineers2005

On the Capacity of Large Gaussian Relay Networks

Martin Vetterli, Michael Christoph Gastpar

2005

Bounds on the k-neighborhood for locally uniformly sampled surfaces

Mark Pauly, Jean Jouve

Given a locally uniform sample set P of a smooth surface S. We derive upper and lower bounds on the number k of nearest neighbors of a sample point p that have to be chosen from P such that this neighborhood contains all restricted Delaunay neighbors of p. ...

Eurographics Association2004

Analysis of a subdomain-based error estimator for finite element approximations of elliptic problems

Fabio Nobile

In this article we analyze a subdomain residual error estimator for finite element approximations of elliptic problems. It is obtained by solving local problems on patches of elements in weighted spaces and provides an upper bound on the energy norm of the ...

Wiley-Blackwell2004

Design of Probabilistic Observers for Mass-Balance-Based Bioprocess Models

Benoît Chachuat, Olivier Bernard

In this paper, the design of probabilistic observers for mass-balance based bioprocess models is investigated. It is assumed that the probability density of every uncertain parameter, input and/or initial state is known a priori. Then, the probability dens ...

2004

On the capacity of large Gaussian relay networks

Martin Vetterli, Michael Christoph Gastpar

We determine the capacity of a particular large Gaussian relay network in the limit as the number of relays tends to infinity. The upper bounds follow from a cut-set argument, and the lower bound follows from an argument involving uncoded transmission. We ...

2002

An Algorithm to Compute Bounds for the Star Discrepancy

Eric Thiémard

We propose an algorithm to compute upper and lower bounds for the star discrepancy of an arbitrary sequence of points in the s-dimensional unit cube. The method is based on a particular partition of the unit cube into subintervals and on a specialized proc ...

2001

Computing Bounds for the Star Discrepancy

Eric Thiémard

We observe that the time required to compute the star discrepancy of a sequence of points in a multidimensional unit cube is prohibitive and that the best known upper bounds for the star discrepancy of (t,s)-sequences and (t,m,s)-nets are useful only for s ...

2000