Incremental View Maintenance for Collection Programming

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.

Universal quantum algorithms that prepare arbitrary n-qubit quantum states require O(2n) gate complexity. The complexity can be reduced by considering specific families of quantum states depending on the task at hand. In particular, multipartite quantum st ...

Many robotics problems are formulated as optimization problems. However, most optimization solvers in robotics are locally optimal and the performance depends a lot on the initial guess. For challenging problems, the solver will often get stuck at poor loc ...

Pearl's do calculus is a complete axiomatic approach to learn the identifiable causal effects from observational data. When such an effect is not identifiable, it is necessary to perform a collection of often costly interventions in the system to learn the ...

The beginning of 21st century provided us with many answers about how to reach the channel capacity. Polarization and spatial coupling are two techniques for achieving the capacity of binary memoryless symmetric channels under low-complexity decoding algor ...

Universal inference enables the construction of confidence intervals and tests without regularity conditions by splitting the data into two parts and appealing to Markov's inequality. Previous investigations have shown that the cost of this generality is a ...

The hardware complexity of modern machines makes the design of adequate programming models crucial for jointly ensuring performance, portability, and productivity in high-performance computing (HPC). Sequential task-based programming models paired with adv ...

The organic small molecule 4,4',4",4"'-(5,5-dimethoxycyclopenta-1,3-diene-1,2,3,4-tetrayl)tetrakis(N,N-bis(4-methoxyhenyl)aniline (CPDA 1), shows electrochemical properties very close to spiro-OMeTAD indicating a high compatibility with PSC systems for its ...

We describe a series of algorithms that efficiently implement Gaussian model-X knockoffs to control the false discovery rate on large-scale feature selection problems. Identifying the knockoff distribution requires solving a large-scale semidefinite progra ...

This paper reports on the computation of a discrete logarithm in the finite field F-230750, breaking by a large margin the previous record, which was set in January 2014 by a computation in F-29234. The present computation made essential use of the elimina ...

Achieving sub-millisecond response times in a managed language environment such as Java introduces significant implementation challenges. The Achilles' heel of Java is its reliance on automatic memory management for reclaiming dead objects. Typically, the ...

Incremental View Maintenance for Collection Programming

Chat with Graph Search

Efficient Preparation of Cyclic Quantum States

Memory of Motion for Initializing Optimization in Robotics

Minimum Cost Intervention Design for Causal Effect Identification

Symmetry in design and decoding of polar-like codes

A note on universal inference

Decentralized in-order execution of a sequential task-based code for shared-memory architectures

Hole transport material, synthesis thereof, and solar cell

FANOK: Knockoffs in Linear Time

Computation Of A 30750-Bit Binary Field Discrete Logarithm

Reflexes: programming abstractions for highly responsive computing in Java