Publication

Towards a secure and trustworthy imaging with non-fungible tokens

Publications associées (33)

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

Automated microfluidic sorting of mammalian cells labeled with magnetic microparticles for those that efficiently express and secrete a protein of interest

Amar Rida, Nicolas Mermod, Etienne Lançon, Niamh Harraghy

We developed a method for the fast sorting and selection of mammalian cells expressing and secreting a protein at high levels. This procedure relies on cell capture using an automated microfluidic device handling antibody-coupled magnetic microparticles an ...

Wiley2017

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

We address the problem of learning a ranking by using adaptively chosen pairwise comparisons. Our goal is to recover the ranking accurately but to sample the comparisons sparingly. If all comparison outcomes are consistent with the ranking, the optimal sol ...

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

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

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

Transliteration among Indian Languages using WX Notation

Pulkit Goyal, Sapan Diwakar, Rohit Gupta

In this paper, we propose an algorithm to transliterate between several Indian languages. The main aim of the algorithm is to assist in the translation process by providing efﬁcient transliteration. This algorithm works on Unicode transformation format of ...

Saarland University Press2010

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

Evaluation of Control and Modulation Methods for Modular Multilevel Converters

Michail Vasiladiotis, Daniel Siemaszko

The modular multilevel converter is a promising converter technology for various high-voltage high-power applications. Despite the apparent simplicity of the circuit, the inherent dynamics of the converter and the balancing of the sub-module capacitor volt ...

2010

Sorting signed permutations by inversions in O(nlogn) time

Bernard Moret, Yu Lin, Vaibhav Rajan, Krister Swenson

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 ...

2010