Querying Persistent Graphs using Solid State Storage

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.

Appropriate waste and resource management are essential for a sustainable circular economy with reduced environmental impact. With critical resources, e-waste may serve as indirect raw material. For example, with NdFeB permanent magnets, Neodymium (Nd) and ...

Information derived from experiences is incorporated into the brain as changes to ensembles of cells, termed engram cells, which allow memory storage and recall. The mechanism by which those changes hold specific information is unclear. Here, we test the h ...

This work presents a graph neural network (GNN) framework for solving the maximum independent set (MIS) problem, inspired by dynamic programming (DP). Specifically, given a graph, we propose a DP-like recursive algorithm based on GNNs that firstly construc ...

Modern hardware is increasingly complex, requiring increasing effort to understand in order to carefully engineer systems for optimal performance and effective utilization. Moreover, established design principles and assumptions are not portable to modern ...

When can a unimodular random planar graph be drawn in the Euclidean or the hyperbolic plane in a way that the distribution of the random drawing is isometry-invariant? This question was answered for one-ended unimodular graphs in Benjamini and Timar, using ...

Federated learning is a semi-distributed algorithm, where a server communicates with multiple dispersed clients to learn a global model. The federated architecture is not robust and is sensitive to communication and computational overloads due to its one-m ...

This thesis demonstrates that it is feasible for systems code to expose a latency interface that describes its latency and related side effects for all inputs, just like the code's semantic interface describes its functionality and related side effects. S ...

The world by and large has adopted the The Paris Agreement, which commits any signing party to cut greenhouse emissions drastically and prevent global heating above 2 °C beyond pre-industrial levels. For this ambitious goal to be met, ratifying states need ...

The adaptive social learning paradigm helps model how networked agents are able to form opinions on a state of nature and track its drifts in a changing environment. In this framework, the agents repeatedly update their beliefs based on private observation ...

In the era of misinformation and information inflation, the credibility assessment of the produced news is of the essence. However, fact-checking can be challenging considering the limited references presented in the news. This challenge can be transcended ...

Querying Persistent Graphs using Solid State Storage

Chat with Graph Search

Surfactant-based enrichment of rare earth elements from NdFeB magnet e-waste: Optimisation of cloud formation and rare earths extraction

Engram cell connectivity as a mechanism for information encoding and memory function

Maximum Independent Set: Self-Training through Dynamic Programming

Chaosity: Understanding Contemporary NUMA-architectures

A full characterization of invariant embeddability of unimodular planar graphs

Privatized graph federated learning

Latency Interfaces for Systems Code

Metal Catalysts for the Electrochemical Reduction of CO2

Discovering Influencers in Opinion Formation Over Social Graphs

On Representation Learning for Scientific News Articles Using Heterogeneous Knowledge Graphs