Concept

Radix sort

Related publications (54)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

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

Sorting Live Stem Cells Based on Sox2 mRNA Expression

Matthias Lütolf, Peter Frey, Jeffrey Alan Hubbell, Hans Mattias Larsson, Seung Tae Lee

While cell sorting usually relies on cell-surface protein markers, molecular beacons (MBs) offer the potential to sort cells based on the presence of any expressed mRNA and in principle could be extremely useful to sort rare cell populations from primary i ...

Public Library of Science2012

Phosphoinositides in Golgi Complex Function

The Golgi complex is a ribbon-like organelle composed of stacks of flat cisternae interconnected by tubular junctions. It occupies a central position in the endomembrane system as proteins and lipids that are synthesized in the endoplasmic reticulum (ER) p ...

2012

Reconstruction of Large-Scale Phylogenies

Vaibhav Rajan

The evolutionary relationships between organisms or phylogenies are fundamental to biology. They are invaluable as guiding tools to mine, organize and exploit the enormous amounts of biological data in the post-genomic era. The advent of high-throughput se ...

EPFL2012

Optimal-Time Adaptive Strong Renaming, with Applications to Counting

Seth Gilbert, Dan Alistarh, Morteza Zadimoghaddam

We give two new randomized algorithms for tight renaming, both of which work against an adaptive adversary. The first uses repeated sampling over a sequence of arrays of decreasing size to assign unique names to each of

n

processes with step complexity $ ...

Acm Order Department, P O Box 64145, Baltimore, Md 21264 Usa2011

Flow and sediment dynamics in bed discordant channel confluences

Anton Schleiss, Koen Blanckaert, Marcelo Leite Ribeiro

Confluences between small steep tributaries with dominant supply of poorly sorted sediment and larger main channels with dominant flow supply, which are characterized by a pronounced bed discordance, have not yet been considered in the literature. The hydr ...

Tsinghua University Press2011

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

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

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 with reception status feedback to transmitters

Ramin Khalili

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

Optimal-Time Adaptive Strong Renaming, with Applications to Counting

Seth Gilbert, Dan Alistarh, Morteza Zadimoghaddam

n

processes with step complexity $ ...

Acm Order Department, P O Box 64145, Baltimore, Md 21264 Usa2011