Abstract. We approach the themes “computing with chaos” and “reservoir computing” in a unified setting. Different neural architectures are mentioned which display chaotic...
Modern web search engines are expected to return top-k results efficiently given a query. Although many dynamic index pruning strategies have been proposed for efficient top-k com...
We present a new algorithm for computing the structure of a finite abelian group, which has to store only a fixed, small number of group elements, independent of the group order....
The control dependence relation is used extensively in restructuring compilers. This relation is usually represented using the control dependence graph; unfortunately, the size of...
Abstract--The recently introduced notion of Finite-Time Lyapunov Exponent to characterize Coherent Lagrangian Structures provides a powerful framework for the visualization and ana...
Christoph Garth, Florian Gerhardt, Xavier Tricoc...