Concept

Quicksort

Related publications (40)

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.

Near-optimal precharging in high-performance nanoscale CMOS caches

Babak Falsafi

High-performance caches statically pull up the bit-lines in all cache subarrays to optimize cache access latency. Unfortunately, such architecture results in a significant waste of energy in nanoscale CMOS implementations due to high leakage and bitline di ...

2003

Efficient Matchmaking and Directory Services

Boi Faltings, Ion Constantinescu

It has been widely recognised that matchmaking is an important component of heterogeneous multiagent systems. Several researchers have developed powerful techniques for the matchmaking problem in general. There are also specific representation of agent cap ...

Swiss Federal Institute of Technology (EPFL)2002

Finding an optimal inversion median: Experimental results

Bernard Moret

We derive a branch-and-bound algorithm to find an optimal inversion median of three signed permutations. The algorithm prunes to manageable size an extremely large search tree using simple geometric properties of the problem and a newly available linear-ti ...

Springer-Verlag2001

Array algorithms for Hoo estimation

Ali H. Sayed

We develop array algorithms for H/sup /spl infin// filtering. These algorithms can be regarded as the Krein space generalizations of H/sup 2/ array algorithms, which are currently the preferred method fur implementing H/sup 2/ filters. The array algorithms ...

2000

The tyrosinase tail mediates sorting to the lysosomal compartment in MDCK cells via a di-leucine and a tyrosine-based signal

Friedrich Beermann

Tyrosinase is a type I membrane protein found in melanosomes, which are lysosomal-like organelles and specific for pigment cells. A mutation of mouse tyrosinase, platinum (cp), leads to truncation of tyrosinase's cytosolic tail, and results in misrouting t ...

1999

Criss-cross methods: a fresh view on pivot algorithms

Criss-cross methods are pivot algorithms that solve linear programming problems in one phase starting with any basic solution. The first finite criss-cross method was invented by Chang, Terlaky and Wang independently. Unlike the simplex method that follows ...

Springer-Verlag1997

Etude expérimentale des couplages mécanosorptifs dans le bois soumis à variations hygrométriques contrôlées sous chargements de longue durée

Subjected to moisture variations under a long-time mechanical loading, wood shows a delayed behaviour, where the total response is not the simple accumulation of those corresponding to the mechanical loading and the zero-load swelling-shrinkage deformation ...

EPFL1996

Developping parallel programs based on rewriting techniques

Starting with a formal problem specification, we show how to progressively achieve a parallel distributed solution, using convenient transformations of specifications. In order to achieve a solution, we use rewriting techniques applied in the context of tr ...

1994

The internalization signal and the phosphorylation site of transferrin receptor are distinct from the main basolateral sorting information

Lukas Kühn

Wild-type human transferrin receptor (hTfR), like endogenous canine receptor, is expressed almost exclusively (97%) at the basolateral membrane of transfected Madin-Darbey canine kidney (MDCK) cells. We investigated the role of two distinct features of the ...

1993

Split-radix algorithms for length-p^m DFT's

Martin Vetterli

The split-radix algorithm for the discrete Fourier transform of length-2^m is by now fairly popular. First, we give the reason why the split-radix algorithm is better tant any single-radix algorithm on length 2^m DFT's. Then, the split-radix approach is ge ...

1989