Publications related to Shellsort

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

QUASII: QUery-Aware Spatial Incremental Index

Anastasia Ailamaki, Thomas Heinis, Mirjana Pavlovic, Darius Sidlauskas

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

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

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

Martinus Adela Maria 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 Adela Maria 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

Optimizing Quantize-Map-and-Forward Relaying for Gaussian Diamond Networks

Christina Fragouli, I-Hsiang Wang, Ayan Sengupta

We evaluate the information-theoretic achievable rates of Quantize-Map-and-Forward (QMF) relaying schemes over Gaussian N-relay diamond networks. Focusing on vector Gaussian quantization at the relays, our goal is to understand how close to the cutset uppe ...

Ieee2012