Uniform parsing for hyperedge replacement grammars

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.

As a universal expression of human creativity, music is capable of conveying great subtlety and complexity. Crucially, this complexity is not encoded in the score or in the sounds, but is rather construed in the mind of the listener in the form of nuanced ...

Sexual harassment is prevalent at all levels of higher education and research and in all disciplines, which means that engineering education is no exception. Following the #MeToo movement, students have started to report cases of abuses publicly in our ins ...

The Gm/ID approach has proven to be an efficient technique for the design of low-power analog circuits. Until now it was mostly demonstrated on older CMOS technology nodes. In this paper we will show that the Gm/ID methodology still holds for advanced tech ...

Graph sparsification has been studied extensively over the past two decades, culminating in spectral sparsifiers of optimal size (up to constant factors). Spectral hypergraph sparsification is a natural analogue of this problem, for which optimal bounds on ...

We conducted a comparative user study of the Infinadeck [1] omnidirectional treadmill native control algorithm alongside an approach based on a state observer control scheme combining a kinematic model with error dynamics that allows users to change their ...

Parsing is the process that enables a computer system to make sense of raw data. Parsing is common to almost all computer systems: It is involved every time sequential data is read and elaborated into structured data. The theory of parsing usually focuses ...

Fuzzers aware of the input grammar can explore deeper program states using grammar-aware mutations. Existing grammar-aware fuzzers are ineffective at synthesizing complex bug triggers due to: (i) grammars introducing a sampling bias during input generation ...

The acquisition of survey responses is a crucial component in conducting research aimed at comprehending public opinion. However, survey data collection can be arduous, time-consuming, and expensive, with no assurance of an adequate response rate. In this ...

Music can be interpreted by attributing syntactic relationships to sequential musical events, and, computationally, such musical interpretation represents an analogous combinatorial task to syntactic processing in language. While this perspective has been ...

We propose the Recursive Non-autoregressive Graph-to-graph Transformer architecture (RNG-Tr) for the iterative refinement of arbitrary graphs through the recursive application of a non-autoregressive Graph-to-Graph Transformer and apply it to syntactic dep ...

Context: Introducing Computer Science (CS) into formal education can be challenging, notably when considering the numerous stakeholders involved which include the students, teachers, schools, and policy makers. We believe these perspectives should be con ...

In this paper, we present an efficient, functional, and formally verified parsing algorithm for LL(1) context-free expressions based on the concept of derivatives of formal languages. Parsing with derivatives is an elegant parsing technique, which, in the ...

This paper studies sufficient conditions to obtain efficient distributed algorithms coloring graphs optimally (i.e. with the minimum number of colors) in the LOCAL model of computation. Most of the work on distributed vertex coloring so far has focused on ...

Maximal subgraph mining is increasingly important in various domains, including bioinformatics, genomics, and chemistry, as it helps identify common characteristics among a set of graphs and enables their classification into different categories. Existing ...

This paper defines a Maximum Likelihood Estimator (MLE) for the admittance matrix estimation of distribution grids, utilising voltage magnitude and power measurements collected only from common, unsychronised measuring devices (Smart Meters). First, we pre ...

Knapsack problems give a simple framework for decision making. A classical example is the min-knapsack problem (MinKnap): choose a subset of items with minimum total cost, whose total profit is above a given threshold. While this model successfully general ...

Optimization is a fundamental tool in modern science. Numerous important tasks in biology, economy, physics and computer science can be cast as optimization problems. Consider the example of machine learning: recent advances have shown that even the most s ...

We publish a dataset containing more than 40’000 manually annotated references from a broad corpus of books and journal articles on the history of Venice. References were considered from both reference lists and footnotes, include primary and secondary sou ...

As the usage of FPGAs spreads, engineers will inevitably employ them in ways unforeseen-or unwanted-by their manufacturers. Xilinx's toolchains offer multiple points for customizing the FPGA compilation flow, but all flows must end with Vivado as it is the ...

Performance critical software is almost always developed in C, as programmers do not trust high-level languages to deliver the same reliable performance. This is bad because low-level code in unsafe languages attracts security vulnerabilities and because d ...

Uniform parsing for hyperedge replacement grammars

Chat with Graph Search

Hearing structure in music: An empirical inquiry into listening as representation and processing

Supporting Well-Being: A Digital Intervention Model for Disclosing Sexual Harassment in Higher Education

Design of Low-power Analog Circuits in Advanced Technology Nodes using the Gm/ID Approach

Spectral Hypergraph Sparsifiers of Nearly Linear Size

User study of omnidirectional treadmill control algorithms in VR

Efficient Parsing with Derivatives and Zippers

Gramatron: Effective Grammar-Aware Fuzzing

Predicting Survey Response with Quotation-based Modeling: A Case Study on Favorability towards the United States

Interpreting Rhythm as Parsing: Syntactic-Processing Operations Predict the Migration of Visual Flashes as Perceived During Listening to Musical Rhythms

Recursive Non-Autoregressive Graph-to-Graph Transformer for Dependency Parsing with Iterative Refinement

A Research-Practice Partnership to Introduce Computer Science in Secondary School: Lessons from a Pilot Program

Zippy LL(1) Parsing with Derivatives

Distributed Coloring of Graphs with an Optimal Number of Colors

Scalable maximal subgraph mining with backbone-preserving graph convolutions

Maximum likelihood estimation of distribution grid topology and parameters from Smart Meter data

On approximation algorithms and polyhedral relaxations for knapsack problems, and clustered planarity testing

New Algorithmic Paradigms for Discrete Problems using Dynamical Systems and Polynomials

Annotated References in the Historiography on Venice: 19th–21st centuries

Bitfiltrator: A general approach for reverse-engineering Xilinx bitstream formats

LMS-Verify: Abstraction without Regret for Verified Systems Programming’