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

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.

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 ...

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 ...

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 ...

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 ...

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 ...

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 ...

A method to extract patterns of activity from time series of data structured as a network of objects, the method comprising the steps of creating a base graph of similar or related items from a given corpus by comparing intrinsic features of the items, com ...

Quasiquotes have been shown to greatly simplify the task of metaprogramming. This is in part because they hide the data structures of the intermediate representation (IR), instead allowing metaprogrammers to use the concrete syntax of the language they man ...

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

Chat with Graph Search

Form follows availability – Designing structures through reuse

A Graph-structured Dataset for Wikipedia Research

Every data structure deserves lock-free memory reclamation

Log-Free Concurrent Data Structures

Log-Free Concurrent Data Structures

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

QUASII: QUery-Aware Spatial Incremental Index

System, device, and method for contextual knowledge retrieval and display

Squid: Type-Safe, Hygienic, and Reusable Quasiquotes