Publications associées à Interval propagation and search on directed acyclic graphs for numerical constraint solving

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.

A Multipath Sparse Beamfroming Method

Hervé Bourlard, Volkan Cevher, Afsaneh Asaei

A novel formulation of beamforming is proposed for acquisition of the signals in reverberant acoustic clutter of interferences and noise. We derive the beamforming methods which incorporate the sparsity structure pertained to the acoustic source distributi ...

2013

Reduced-Dimension Linear Transform Coding of Correlated Signals in Networks

Michael Christoph Gastpar, Naveen Goela

A model called the linear transform network (LTN) is proposed to analyze the compression and estimation of correlated signals transmitted over directed acyclic graphs (DAGs). An LTN is a DAG network with multiple source and receiver nodes. Source nodes tra ...

Institute of Electrical and Electronics Engineers2012

The impact of mobility on the time complexity for deterministic broadcasting in radio networks

André Schiper, David Cavin, Yoav Sasson

We study the time complexity for deterministic broadcasting algorithms in mobile radio networks. The broadcast operation consists of a source node successfully communicating its message to every other node. In multi-hop radio networks such as MANETs, the m ...

2011

Input Filter Design for Feasibility in Constraint-Adaptation Schemes

Dominique Bonvin, Grégory François, Gene Bunin

The subject of real-time, steady-state optimization under significant uncertainty is addressed in this paper. Specifically, the use of constraint-adaptation schemes is reviewed, and it is shown that, in general, such schemes cannot guarantee process feasib ...

2011

Ordered Sets in the Calculus of Data Structures

Viktor Kuncak, Philippe Paul Henri Suter, Ruzica Piskac

Our goal is to identify families of relations that are useful for reasoning about software. We describe such families using decidable quantifier-free classes of logical constraints with a rich set of operations. A key challenge is to define such classes of ...

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2010

Selective Input Adaptation in Parametric Optimal Control Problems with Path Constraints

Dominique Bonvin, Benoît Chachuat, Saurabh Anand Deshpande

This paper is concerned with input adaptation in dynamic processes in order to guarantee feasible and optimal operation despite the presence of uncertainty. For optimal control problems having mixed control-state constraints, two sets of directions can be ...

2010

Enhancing numerical constraint propagation using multiple inclusion representations

Boi Faltings, Xuan-Ha Vu

Building tight and conservative enclosures of the solution set is of crucial importance in the design of efficient complete solvers for numerical constraint satisfaction problems (NCSPs). This paper proposes a novel generic algorithm enabling the cooperati ...

Springer Netherlands2009

Temporally Consistent Layer Depth Ordering Via Pixel Voting For Pseudo 3D Representation

Engin Türetken

A new region-based depth ordering algorithm is proposed based on the segmented motion layers with affine motion models. Starting from an initial set of layers that are independently extracted for each frame of an input sequence, relative depth order of eve ...

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

Linear Compressive Networks

Michael Christoph Gastpar, Naveen Goela

A linear compressive network (LCN) is defined as a graph of sensors in which each encoding sensor compresses incoming jointly Gaussian random signals and transmits (potentially) low-dimensional linear projections to neighbors over a noisy uncoded channel. ...

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

Interval propagation and search on directed acyclic graphs for numerical constraint solving

Graph Chatbot

Chattez avec Graph Search

A Multipath Sparse Beamfroming Method

Reduced-Dimension Linear Transform Coding of Correlated Signals in Networks

The impact of mobility on the time complexity for deterministic broadcasting in radio networks

Input Filter Design for Feasibility in Constraint-Adaptation Schemes

MDD propagators with explanation

Ordered Sets in the Calculus of Data Structures

Selective Input Adaptation in Parametric Optimal Control Problems with Path Constraints

Enhancing numerical constraint propagation using multiple inclusion representations

Temporally Consistent Layer Depth Ordering Via Pixel Voting For Pseudo 3D Representation

Linear Compressive Networks

A Multipath Sparse Beamfroming Method

The impact of mobility on the time complexity for deterministic broadcasting in radio networks

Selective Input Adaptation in Parametric Optimal Control Problems with Path Constraints

Ordered Sets in the Calculus of Data Structures

Reduced-Dimension Linear Transform Coding of Correlated Signals in Networks

MDD propagators with explanation

Input Filter Design for Feasibility in Constraint-Adaptation Schemes

Enhancing numerical constraint propagation using multiple inclusion representations

Temporally Consistent Layer Depth Ordering Via Pixel Voting For Pseudo 3D Representation

Linear Compressive Networks