Concept

Algorithme de tri externe

Publications associées (51)

Single-Virus Droplet Microfluidics for High-Throughput Screening of Neutralizing Epitopes on HIV Particles

Analyzing surface epitopes of single HIV particles holds great potential for the development of vaccine candidates. However, existing technologies do not allow corresponding screens at high throughput. We present here a single-virus droplet-based microflui ...

2017

A bucket sort algorithm for the particle-in-cell method on manycore architectures

Laurent Villard, Stephan Brunner, Trach-Minh Tran, Claudio Gheller

The Particle-In-Cell (PIC) method is effectively used in many scientific simulation codes. In order to optimize the performance of the PIC approach, data locality is required. This relies on efficient sorting algorithms. We present a bucket sort algorithm ...

Springer2016

Size-dependent sorting of C. elegans nematodes through an adjustable microfluidic filter structure.

Martinus Gijs, Thomas Lehnert, Matteo Cornaglia, Li Dong

We introduce a new and simple microfluidic sorting device based on adjustable filter structures that can be easily tuned by external pressure for a specific size-dependent C. elegans worm sorting experiment. A single device can be used for selecting and so ...

2016

Haplosufficiency of PAX3 for melanoma development in Tyr: NRASQ61K; Cdkn2a-/- mice allows identification and sorting of melanoma cells using a Pax3GFP reporter allele

Friedrich Beermann

The role of the Pax3 gene in embryonic development of pigment cells is well characterized. By contrast, the function of Pax3 in melanoma development is controversial. Indeed, data obtained from cultured cells suggest that PAX3 may contribute to melanomagen ...

Lippincott Williams & Wilkins2016

Versatile size-dependent sorting of C-elegans nematodes and embryos using a tunable microfluidic filter structure

Martinus Gijs, Thomas Lehnert, Matteo Cornaglia, Li Dong

The roundworm Caenorhabditis elegans (C. elegans) is a powerful model organism for addressing fundamental biological questions related to human disease and aging. Its life cycle consists of an embryo stage, four larval stages that can be clearly distinguis ...

Royal Soc Chemistry2016

Calibration method and system

Martin Vetterli, Ivan Dokmanic

The present invention concerns a method for calibrating an array of receivers (ri), each receiver being configured for receiving a signal transmitted by at least one transmitter (si), and echoes of the transmitted signal as reflected by one or more reflect ...

2014

Merging Inhomogeneous Proximity Sensor Systems for Social Network Analysis

Agon Bexheti, Amir Muaremi

Proximity information is a valuable source for social network analysis. Smartphone based sensors, like GPS, Bluetooth and ANT+, can be used to obtain proximity information between individuals within a group. However, in real-life scenarios, different peopl ...

Springer Int Publishing Ag2014

Tight Bounds for Asynchronous Renaming

Rachid Guerraoui, Seth Gilbert, Dan Alistarh

This article presents the first tight bounds on the time complexity of shared-memory renaming, a fundamental problem in distributed computing in which a set of processes need to pick distinct identifiers from a small namespace. We first prove an individual ...

Association for Computing Machinery2014

Cracking The Complexity Of Fixed-Point Refinement In Complex Wireless Systems

Paolo Ienne, David Novo Bruna

Fixed-point arithmetic leads to efficient implementations. However, the optimization process required to size each of the implementation signals can be prohibitively complex. In this paper, we introduce a new divide-and-conquer method that is able to appro ...

Ieee2013

Clustering on Multi-Layer Graphs via Subspace Analysis on Grassmann Manifolds

Pascal Frossard, Pierre Vandergheynst, Xiaowen Dong

Relationships between entities in datasets are often of multiple types, which can naturally be modeled by a multi-layer graph; a common vertex set represents the entities and the edges on different layers capture different types of relationships between th ...

2013

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