Publication

Grammar-Based Tree Compression

Publications associées (39)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

Visualization, Adaptation, and Transformation of Procedural Grammars

Stefan Lienhard

Procedural shape grammars are powerful tools for the automatic generation of highly detailed 3D content from a set of descriptive rules. It is easy to encode variations in stochastic and parametric grammars, and an uncountable number of models can be gener ...

EPFL2017

Differential Gene Expression with Lossy Compression of Quality Scores in RNA-Seq Data

Marco Mattavelli, Claudio Paolo Alberti, Ana Angelica Hernandez Lopez

High-Throughput sequencing of RNA molecules has enabled the quantitative analysis of the expression of genes at the expense of storage space and processing power. To help alleviate these problems, lossy compression methods of the quality scores associated ...

2017

Fully Quantized Distributed Gradient Descent

n major distributed optimization system, the main bottleneck is often the communication between the different machines. To reduce the time dedicated to communications, some heuristics have been developed to reduce the precision of the messages sent and hav ...

2017

Design Transformations for Rule-based Procedural Modeling

Mark Pauly, Cheryl Shaulya Lau, Stefan Lienhard

We introduce design transformations for rule-based procedural models, e.g., for buildings and plants. Given two or more procedural designs, each specified by a grammar, a design transformation combines elements of the existing designs to generate new desig ...

Wiley2017

Caradoc: a pragmatic approach to PDF parsing and validation

PDF has become a de facto standard for exchanging electronic documents, for visualization as well as for printing. However, it has also become a common delivery channel for malware, and previous work has highlighted features that lead to security issues. I ...

Ieee2016

Towards Automating Grammar Equivalence Checking

Viktor Kuncak, Mikaël Mayer, Ravichandhran Kandhadai Madhavan

We consider from practical perspective the (generally undecidable) problem of checking equivalence of context-free grammars. We present both techniques for proving equivalence, as well as techniques for finding counter-examples that establish non-equivalen ...

2015

Automating Grammar Comparison

Viktor Kuncak, Mikaël Mayer, Ravichandhran Kandhadai Madhavan

We consider from a practical perspective the problem of checking equivalence of context-free grammars. We present techniques for proving equivalence, as well as techniques for finding counter-examples that establish non-equivalence. Among the key building ...

2015

Automating Grammar Comparison

Viktor Kuncak, Mikaël Mayer, Ravichandhran Kandhadai Madhavan

Assoc Computing Machinery2015

Grammar-based generation of equilibrium structures through graphic statics

Corentin Jean Dominique Fivet

This paper proposes a grammar-based structural design methodology using graphic statics. By combining shape grammars with graphic statics, this method enables the designer to: 1) rapidly generate unique, yet functional structures that fall outside of the e ...

IASS2015

Scaling Similarity Joins over Tree-Structured Data

Given a large collection of tree-structured objects (e.g., XML documents), the similarity join finds the pairs of objects that are similar to each other, based on a similarity threshold and a tree edit distance measure. The state-of-the-art similarity join ...

Assoc Computing Machinery2015