Publications associées à RRB-Trees: Efficient Immutable Vectors

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.

Synthesis of uniform amplitude focused beam arrays

Juan Ramon Mosig, Anja Skrivervik, Benjamin Fuchs

An iterative procedure for the synthesis of uniform amplitude focused beam arrays is presented. Specifically, the goal is to optimize the locations of a fixed number of array elements with known excitations in order to synthesize narrow-beam low-sidelobe p ...

2012

Array-Code Ensembles -or- Two-Dimensional LDPC Codes

Mohammad Amin Shokrollahi, Yuval Cassuto

Probabilistic construction of codes on two-dimensional arrays is proposed and analyzed. Instead of a pure combinatorial erasure model used in traditional array codes, we propose a mixed combinatorial-probabilistic model of limiting the number of column fai ...

IEEE Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2011

A union of incoherent spaces model for classification

Pierre Vandergheynst, Karin Schnass

We present a new and computationally efficient scheme for classifying signals into a fixed number of known classes. We model classes as subspaces in which the corresponding data is well represented by a dictionary of features. In order to ensure low miscla ...

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

On Satisfiability Modulo Computable Functions

Viktor Kuncak, Philippe Paul Henri Suter, Ali Sinan Köksal

We present a semi-decision procedure for checking satisfiability of formulas in the language of algebraic data types and integer linear arithmetic extended with user-defined terminating recursive functions. Our procedure is designed to integrate into a DPL ...

2010

Demosaicking by Alternating Projections: Theory and Fast One-Step Implementation

Martin Vetterli, Yue Lu, Mina Karzand

Color image demosaicking is a key process in the digital imaging pipeline. In this paper, we study a well-known and influential demosaicking algorithm based on alternating projections (AP), proposed by Gunturk, Altunbasak and Mersereau in 2002. Since its p ...

Institute of Electrical and Electronics Engineers2010

Fast Space-Variant Elliptical Filtering Using Box Splines

Michaël Unser, Kunal Narayan Chaudhury

The efficient realization of linear space-variant (non-convolution) filters is a challenging computational problem in image processing. In this paper, we demonstrate that it is possible to filter an image with a Gaussian-like elliptic window of varying siz ...

IEEE2010

Projeter ensemble. Une nouvelle patinoire à Lausanne.

Rainer Epp, Florent Rouvenaz

Le projet est issu d'une étroite collaboration entre deux futures architectes et un étudiant en génie civil. Cette approche interdisciplinaire répond à la nécessité grandissante de coopération entre architectes et ingénieurs dans le développement de projet ...

2010

On Decision Procedures for Algebraic Data Types with Abstractions

Viktor Kuncak, Philippe Paul Henri Suter, Mirco Dotta

We describe a parameterized decision procedure that extends the decision procedure for functional recursive algebraic data types (trees) with the ability to specify and reason about abstractions of data structures. The abstract values are specified using r ...

2009

RRB-Trees: Efficient Immutable Vectors

Graph Chatbot

Chattez avec Graph Search

Synthesis of uniform amplitude focused beam arrays

Programming with Specifications

STM in the Small: Trading Generality for Performance in Software Transactional Memory

Array-Code Ensembles -or- Two-Dimensional LDPC Codes

A union of incoherent spaces model for classification

On Satisfiability Modulo Computable Functions

Demosaicking by Alternating Projections: Theory and Fast One-Step Implementation

Fast Space-Variant Elliptical Filtering Using Box Splines

Projeter ensemble. Une nouvelle patinoire à Lausanne.

On Decision Procedures for Algebraic Data Types with Abstractions

Synthesis of uniform amplitude focused beam arrays

STM in the Small: Trading Generality for Performance in Software Transactional Memory

Programming with Specifications

Array-Code Ensembles -or- Two-Dimensional LDPC Codes

A union of incoherent spaces model for classification

On Satisfiability Modulo Computable Functions

On Decision Procedures for Algebraic Data Types with Abstractions

Fast Space-Variant Elliptical Filtering Using Box Splines

Demosaicking by Alternating Projections: Theory and Fast One-Step Implementation

Projeter ensemble. Une nouvelle patinoire à Lausanne.