Concept

Arborescence

Publications associées (71)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

RRB Vector: A Practical General Purpose Immutable Sequence

Martin Odersky, Tiark Rompf, Nicolas Alexander Stucki, Vlad Ureche

State-of-the-art immutable collections have wildly differing performance characteristics across their operations, often forcing programmers to choose different collection implementations for each task. Thus, changes to the program can invalidate the choice ...

ACM2015

RUBIK: Efficient Threshold Queries on Massive Time Series

Anastasia Ailamaki, Thomas Heinis, Farhan Tauheed, Eleni Tzirita Zacharatou

An increasing number of applications from finance, meteorology, science and others are producing time series as output. The analysis of the vast amount of time series is key to understand the phenomena studied, particularly in the simulation sciences, wher ...

2015

Turning Relaxed Radix Balanced Vector from Theory into Practice for Scala Collections (Master Thesis)

Nicolas Alexander Stucki

The immutable Vector collection in the Scala library offers nearly constant-time random access reads thanks to its underlying wide tree data structure. Furthermore, it provides amortized constant time sequential read, update, append and prepend operations ...

2015

Symbolic Resource Bound Inference

Viktor Kuncak, Ravichandhran Kandhadai Madhavan

We present an approach for inferring symbolic resource bounds for purely functional programs consisting of recursive functions, algebraic data types and nonlinear arithmetic operations. In our approach, the developer specifies the desired shape of the boun ...

2014

Distributed Rate Allocation in Inter-Session Network Coding

Pascal Frossard, Nikolaos Thomos, Eirina Bourtsoulatze

In this work, we propose a distributed rate allocation algorithm that minimizes the average decoding delay for multimedia clients in inter-session network coding systems. We consider a scenario where the users are organized in a mesh network and each user ...

Institute of Electrical and Electronics Engineers2014

, ,

Background: Maximum Intensity Projections (MIP) of neuronal dendritic trees obtained from confocal microscopy are frequently used to study the relationship between tree morphology and mechanosensory function in the model organism C. elegans. Extracting den ...

Biomed Central Ltd2014

Vortex lattice structure in BaFe2(As0.67P0.33)(2) via small-angle neutron scattering

Jonathan White

We have observed a magnetic vortex lattice (VL) in BaFe2(As0.67P0.33)(2) (BFAP) single crystals by small-angle neutron scattering. With the field along the c axis, a nearly isotropic hexagonal VL was formed in the field range from 1 to 16 T, and no symmetr ...

Amer Physical Soc2014

, , ,

Scaling the performance of shared-everything transaction processing systems to highly-parallel multicore hardware remains a challenge for database system designers. Recent proposals alleviate locking and logging bottlenecks in the system, leaving page latc ...

2013

Cover Tree Bayesian Reinforcement Learning

Christos Dimitrakakis, Nikolaos Tziortziotis

This paper proposes an online tree-based Bayesian approach for reinforcement learning. For inference, we employ a generalised context tree model. This defines a distribution on multivariate Gaussian piecewise-linear models, which can be updated in closed f ...

2013

Infinite nature of sensor data poses a serious challenge for query processing even in a cloud infrastructure. Model-based sensor data approximation reduces the amount of data for query processing, but all modeled segments need to be scanned, in the worst c ...

2013