A bucket sort algorithm for the particle-in-cell method on manycore architectures
Publications associées (36)
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.
An ever more complete picture of the organization and function of the endocytic pathway is emerging. New mechanisms, and in particular lipid- based mechanisms that couple membrane dynamics and sorting, are being unraveled. But the final picture is still co ...
The study of genomic inversions (or reversals) has been a mainstay of computational genomics for nearly 20 years. After the initial breakthrough of Hannenhalli and Pevzner, who gave the first polynomial-time algorithm for sorting signed permutations by inv ...
Alginate gel formation on-chip is presented in the first part of this thesis. The technique allows immobilization, and release, of biological cells on-chip. Furthermore, via layer by layer deposition, a locally heterogeneous environment can be generated at ...
This paper reports on a device capable of electrical cell lysis and evaluation of lysis efficiency in continuous flow using dielectrophoretic cell sorting. The device uses an innovative design, called liquid electrodes, to perform both cell lysis and cell ...
In order to cope with sustainable development policy, buildings should be at least healthy, comfortable and energy efficient. Criteria for assessing individually the occupant's perceived health, the provided thermal, visual, acoustical comfort, the indoor ...
Neighbor discovery is essential for the process of self-organization of a wireless network, where almost all routing and medium access protocols need knowledge of one-hop neighbors. In this paper we study the problem of neighbor discovery in a static and s ...
Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2010
Inspired by the combinatorial denoising method {\tt DUDE} \cite{WOSVW04}, we present efficient algorithms for implementing this idea for arbitrary contexts or for using it within subsequences. We also propose effective, efficient denoising error estimators ...
DNA is a long polymer with the form of a double helix of about two nanometers diameter (2.10-9 meters). It is composed of nucleotides whose sequence carries the information of heredity. The four possible nucleotides have slightly different geometries, and ...
We use cryo-electron microscopy to compare 3D shapes of 158 bp long DNA minicircles that differ only in the sequence within an 18 bp block containing either a TATA box or a catabolite activator protein binding site. We present a sorting algorithm that corr ...