Concept

Sorting algorithm

Related publications (663)

LUT Mapping and Optimization for Majority-Inverter Graphs

Giovanni De Micheli, Mathias Soeken, Pierre-Emmanuel Julien Marc Gaillardon, Luca Gaetano Amarù, Winston Jason Haaswijk

A Majority-Inverter Graph (MIG) is a directed acyclic graph in which every vertex represents a three-input majority operation and edges may be complemented to indicate operand inversion. MIGs have algebraic and Boolean properties that enable efficie ...

2016

Modular interface for embedded audio acquisition platforms

Basile Gérard Pierre Bruneau

In this project, I developed a browser based interface for prototyping real-time processing algorithms using embedded multi channel audio acquisition platforms. The interface allows to interact in an easy manner with a GNU/Linux enabled single board comput ...

2016

Synthesizing Robotic Handwriting Motion by Learning from Human Demonstrations

Aude Billard, Hang Yin, Ana Paiva

This paper contributes a novel framework that enables a robotic agent to efficiently learn and synthesize believable handwriting motion. We situate the framework as a foundation with the goal of allowing children to observe, correct and engage with the rob ...

2016

Randomized Single-View Algorithms for Low-Rank Matrix Approximation

Volkan Cevher, Alp Yurtsever

This paper develops a suite of algorithms for constructing low-rank approximations of an input matrix from a random linear image of the matrix, called a sketch. These methods can preserve structural properties of the input matrix, such as positive-semideni ...

Under review2016

Asynchronized Concurrency: The Secret to Scaling Concurrent Search Data Structures

Rachid Guerraoui, Vasileios Trigonakis, Tudor Alexandru David

We introduce "asynchronized concurrency (ASCY),'' a paradigm consisting of four complementary programming patterns. ASCY calls for the design of concurrent search data structures (CSDSs) to resemble that of their sequential counterparts. We argue that ASCY ...

2015

Adaptation and Awareness in Robot Ensembles: Scenarios and Algorithms

Francesco Mondada, Michael Bonani

This chapter presents a disaster recovery scenario that has been used throughout the ASCENS project as a reference to coordinate the study of distributed algorithms for robot ensembles. We first introduce the main traits and open problems in the design of ...

Springer2015

Reduced Basis Techniques For Nonlinear Conservation Laws

Alfio Quarteroni

In this paper we present a new reduced basis technique for parametrized nonlinear scalar conservation laws in presence of shocks. The essential ingredients are an efficient algorithm to approximate the shock curve, a procedure to detect the smooth componen ...

EDP Sciences2015

Progressive Geometric Algorithms

Timur Bagautdinov

Progressive algorithms are algorithms that, on the way to computing a complete solution to the problem at hand, output intermediate solutions that approximate the complete solution increasingly well. We present a framework for analyzing such algorithms, an ...

Carleton Univ, Dept Mathematics & Statistics2015

Solving the Shortest Vector Problem in 2^n Time via Discrete Gaussian Sampling

Divesh Aggarwal

We give a randomized 2^{n+o(n)}-time and space algorithm for solving the Shortest Vector Problem (SVP) on n-dimensional Euclidean lattices. This improves on the previous fastest algorithm: the deterministic O(4^n)-time and O(2^n)-space algorithm of Miccian ...

ACM2015

MATHICSE Technical Report : Accelerated filtering on graphs using Lanczos method

Pierre Vandergheynst, Daniel Kressner, Nathanaël Perraudin, Ana Susnjara

Sinal-processing on graphs has developed into a very active field of research during the last decade. In particular, the number of applications using frames con-structed from graphs, like wavelets on graphs, has substantially increased. To attain scalabili ...

MATHICSE2015

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.