Concept

Bounded set

Related publications (84)

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.

Partitioning datasets based on equalities among parameters

Giancarlo Ferrari Trecate

When a phenomenon is described by a parametric model and multiple datasets are available, a key problem in statistics is to discover which datasets are characterized by the same parameter values. Equivalently, one is interested in partitioning the family o ...

2010

Tight Bounds on the Capacity of Binary Input random CDMA Systems

Nicolas Macris, Satish Babu Korada

We consider multiple access communication on a binary input additive white Gaussian noise channel using randomly spread code division. For a general class of symmetric distributions for spreading coefficients, in the limit of a large number of users, we pr ...

2010

An Average-Case Analysis for Rate-Monotonic Multiprocessor Real-time Scheduling

Thomas Rothvoss

We introduce the "First Fit Matching Periods" algorithm for static-priority multiprocessor scheduling of periodic tasks with implicit deadlines and show that it yields asymptotically optimal processor assignments if utilization values are chosen uniformly ...

Springer2009

Weighted A* search - unifying view and application

The A* algorithm is a well-known heuristic best-first search method. Several performance-accelerated extensions of the exact A* approach are known. Interesting examples are approximate algorithms where the heuristic function used is inflated by a weight (o ...

2009

Approximating the Gaussian Multiple Description Rate Region Under Symmetric Distortion

Suhas Diggavi

We consider multiple description (MD) coding for the Gaussian source with K descriptions under the symmetric mean-squared error (MSE) distortion constraints, and provide an approximate characterization of the rate region. We show that the rate region can b ...

2009

Partitioning Datasets Based on Equalities Among Parameters

Giancarlo Ferrari Trecate

2009

On Depth-bounded Message Passing Systems

Damien Zufferey

We explore the border between decidability and undecidability of verification problems related to message passing systems that admit unbounded creation of threads and name mobility. Inspired by use cases in real-life programs we introduce the notion of dep ...

2009

Some coloring and walking problems in graphs

Benjamin Leroy-Beaulieu

Graph theory is an important topic in discrete mathematics. It is particularly interesting because it has a wide range of applications. Among the main problems in graph theory, we shall mention the following ones: graph coloring and the Hamiltonian circuit ...

EPFL2008

Fountain codes for piecewise stationary channels

Mohammad Amin Shokrollahi, Bertrand Ndzana Ndzana

In this paper, two fixed per-information symbol complexity lossless source coding algorithms are modified for estimation and incremental LT decoding over piecewise stationary memoryless channels (PSMC's) with a bounded number of abrupt changes in channel s ...

IEEE2008

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