Algorithms for the implementation of adaptive isogeometric methods using hierarchical B-splines

À propos
Confidentialité
Mentions légales

Graph Chatbot

Publications associées (30)

Page 2 sur 2

Form follows availability – Designing structures through reuse

Corentin Jean Dominique Fivet, Jan Friedrich Georg Brütting, Gennaro Senatore

This work proposes a new direction in structural design: the synthesis of structures through the reuse of elements. Reusing structural elements reduces the environmental impacts of building structures because it avoids sourcing new material, it reduces was ...

International Center for Numerical Methods in Engineering (CIMNE)2019

A Graph-structured Dataset for Wikipedia Research

Pierre Vandergheynst, Nicolas Aspert, Volodymyr Miz, Benjamin Ricaud

Wikipedia is a rich and invaluable source of information. Its central place on the Web makes it a particularly interesting object of study for scientists. Researchers from different domains used various complex datasets related to Wikipedia to study langua ...

ACM2019

Every data structure deserves lock-free memory reclamation

Nachshon Cohen

Memory-management support for lock-free data structures is well known to be a tough problem. Recent work has successfully reduced the overhead of such schemes. However, applying memory-management support to a data structure remains complex and, in many cas ...

2018

Log-Free Concurrent Data Structures

Rachid Guerraoui, Aleksandar Dragojevic, Mihail Igor Zablotchi, Tudor Alexandru David

Non-volatile RAM (NVRAM) makes it possible for data structures to tolerate transient failures, assuming however that programmers have designed these structures such that their consistency is preserved upon recovery. Previous ap- proaches are typically tran ...

USENIX Association2018

Log-Free Concurrent Data Structures

Rachid Guerraoui, Mihail Igor Zablotchi, Aleksandar Dragojevic, Tudor Alexandru David

USENIX ASSOC2018

Low-rank tensor methods for large Markov chains and forward feature selection methods

Francisco Santos Paredes Quartin de Macedo

In the first part of this thesis, we present and compare several approaches for the determination of the steady-state of large-scale Markov chains with an underlying low-rank tensor structure. Such structure is, in our context of interest, associated with ...

EPFL2018

QUASII: QUery-Aware Spatial Incremental Index

Anastasia Ailamaki, Thomas Heinis, Mirjana Pavlovic, Darius Sidlauskas

With large-scale simulations of increasingly detailed models and improvement of data acquisition technologies, massive amounts of data are easily and quickly created and collected. Traditional systems require indexes to be built before analytic queries can ...

2018

On verifying causal consistency

Rachid Guerraoui, Jad Hamza

Causal consistency is one of the most adopted consistency criteria for distributed implementations of data structures. It ensures that operations are executed at all sites according to their causal precedence. We address the issue of verifying automaticall ...

Verification by Reduction to Functional Programs

Régis William Blanc

In this thesis, we explore techniques for the development and verification of programs in a high-level, expressive, and safe programming language. Our programs can express problems over unbounded domains and over recursive and mutable data structures. We p ...

EPFL2017

From recommender systems to spatio-temporal dynamics with network science

Kirell Maël Benzi

Networks are data structures that are fundamental for capturing and analyzing complex interactions between objects. While they have been used for decades to solve problems in virtually all scientific fields, their usage for data analysis in real-world prac ...

EPFL2017