Concept

Tri de Shell

Publications associées (18)

Memoryless Worker-Task Assignment with Polylogarithmic Switching Cost

We study the basic problem of assigning memoryless workers to tasks with dynamically changing demands. Given a set of w workers and a multiset T ⊆ [t] of |T| = w tasks, a memoryless worker-task assignment function is any function ϕ that assigns the workers ...

Schloss Dagstuhl -- Leibniz-Zentrum fur Informatik2022

Time- and Space-Efficient Spatial Data Analytics

Mirjana Pavlovic

Advances in data acquisition technologies and supercomputing for large-scale simulations have led to an exponential growth in the volume of spatial data. This growth is accompanied by an increase in data complexity, such as spatial density, but also by mor ...

EPFL2019

QUASII: QUery-Aware Spatial Incremental Index

Anastasia Ailamaki, Darius Sidlauskas, Thomas Heinis, Mirjana Pavlovic

With large-scale simulations of increasingly detailed models and improvement of data acquisition technologies, massive amounts of data are easily and quickly created and collected. Traditional systems require indexes to be built before analytic queries can ...

2018

Round Compression for Parallel Matching Algorithms

Slobodan Mitrovic, Aleksander Madry

For over a decade now we have been witnessing the success of massive parallel computation (MPC) frameworks, such as MapReduce, Hadoop, Dryad, or Spark. One of the reasons for their success is the fact that these frameworks are able to accurately capture th ...

ASSOC COMPUTING MACHINERY2018

Lab-on-a-chip technologies for manipulation and imaging of C. elegans worms and embryos

Li Dong

The nematode Caenorhabditis elegans is an attractive model organism, owing notably to its short life cycle, genetic tractability, and optical transparency facilitating microscopic observation. This thesis deals with the realization of technological tools f ...

EPFL2018

Just Sort It! A Simple and Effective Approach to Active Preference Learning

Matthias Grossglauser, Lucas Maystre

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

Advancing Biocapture Substrates via Chemical Lift-Off Lithography

Nako Nakatsuka

Creating small-molecule-functionalized platforms for high-throughput screening or biosensing applications requires precise placement of probes on solid substrates and the ability to capture and to sort targets from multicomponent samples. Here, chemical li ...

2017

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

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

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

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