Concept

Self-balancing binary search tree

Publications associées (58)

A 65k pixel, 150k frames-per-second camera with global gating and micro-lenses suitable for fluorescence lifetime imaging

Edoardo Charbon, Claudio Bruschini, Francesco Regazzoni, Samuel Burri, François Eric Powolny

This paper presents our work on a 65k pixel single-photon avalanche diode (SPAD) based imaging sensor realized in a 0.35 mu m standard CMOS process. At a resolution of 512 by 128 pixels the sensor is read out in 6.4ps to deliver over 150k monochrome frames ...

Spie-Int Soc Optical Engineering2014

A novel cmos image sensor with event/change detection and reduced data redundancy

Giovanni De Micheli, Sandro Carrara, Gözen Köklü

A Digital Pixel Sensor (DPS) based CMOS camera configured to record frames and comprising an event detection sensor configured to look for an event happening in a determined frame, comprising an array of event detection pixels, a first reference voltage ge ...

2014

Accelerating Spatial Range Queries

Anastasia Ailamaki, Thomas Heinis, Farhan Tauheed, Alexandros Stougiannis

It is increasingly common for domain scientists to use computational tools to build and simulate spatial models of the phenomena they are studying. The spatial models they build are more and more detailed as well as dense and are consequently difficult to ...

2013

Binary Compressed Imaging

Michaël Unser, Aurélien Bourquard

Compressed sensing can substantially reduce the number of samples required for conventional signal acquisition at the expense of an additional reconstruction procedure. It also provides robust reconstruction when using quantized measurements, including in ...

Ieee-Inst Electrical Electronics Engineers Inc2013

A Speculation-Friendly Binary Search Tree

Vincent Gramoli

We introduce the first binary search tree algorithm designed for speculative executions. Prior to this work, tree structures were mainly designed for their pessimistic (non-speculative) accesses to have a bounded complexity. Researchers tried to evaluate t ...

Assoc Computing Machinery2012

Integrated Kernel Partitioning and Scheduling for Coarse-Grained Reconfigurable Arrays

Giovanni Ansaloni

Coarse-grained reconfigurable arrays (CGRAs) are a promising class of architectures conjugating flexibility and efficiency. Devising effective methodologies to map applications onto CGRAs is a challenging task, due to their parallel execution paradigm and ...

Institute of Electrical and Electronics Engineers2012

CAT(0) Geometry for the Thompson Group

Dan Titus Salajan

We investigate Farley’s CAT(0) cubical model for Thompson’s group F (we adopt the classical language of F, using binary trees and piecewise linear maps, avoiding the one of diagram groups and pictures). Main results include: in general, Thompson’s group el ...

EPFL2012

Programming with Specifications

Philippe Paul Henri Suter

This thesis explores the use of specifications for the construction of correct programs. We go beyond their standard use as run-time assertions, and present algorithms, techniques and implementations for the tasks of 1) program verification, 2) declarative ...

EPFL2012

Development of Tunable Optical MEMS for Advanced Laser Beam Shaping, Homogenizing and Speckle Reduction

Jonathan Masson

In this thesis, the development, design, fabrication and characterization of three innovative laser beam shaping, homogenizing and speckle reduction devices are reported. Typical beam shaping devices are static and not easily adaptable to a large variety o ...

EPFL2012

A metric for phylogenetic trees based on matching

Bernard Moret, Yu Lin, Vaibhav Rajan

Comparing two or more phylogenetic trees is a fundamental task in computational biology. The simplest outcome of such a comparison is a pairwise measure of similarity, dissimilarity, or distance. A large number of such measures have been proposed, but so t ...

Springer Verlag2011

Graph Chatbot

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.

Connectez-vous pour utiliser Chat avec Graph Search