Publications associées à Analyseur LR

Staged parser combinators for efficient data processing

Martin Odersky, Tiark Rompf, Sandro Stucki, Manohar Jonnalagedda, Thierry Coppey

Parsers are ubiquitous in computing, and many applications depend on their performance for decoding data efficiently. Parser combinators are an intuitive tool for writing parsers: tight integration with the host language enables grammar specifications to b ...

ACM Press2014

Staged Parser Combinators for Efficient Data Processing

Martin Odersky, Tiark Rompf, Sandro Stucki, Manohar Jonnalagedda, Thierry Coppey

Assoc Computing Machinery2014

Query management system and engine allowing for efficient query execution on raw details

Anastasia Ailamaki, Ioannis Alagiannis

A database system maintains a feature set of a modern database system while operating directly on raw data files. Systems may use an adaptive indexing mechanism that maintains positional information to provide efficient access to raw data files, a flexible ...

2014

Accelerating parser combinators with macros

Manohar Jonnalagedda, Eric Beguet

Parser combinators provide an elegant way of writing parsers: parser implementations closely follow the structure of the underlying grammar, while accommodating interleaved host language code for data processing. However, the host language features used fo ...

ACM Press2014

Finding Trojan Message Vulnerabilities in Distributed Systems

Rachid Guerraoui, George Candea, Radu Banabic

Trojan messages are messages that seem correct to the receiver but cannot be generated by any correct sender. Such messages constitute major vulnerability points of a distributed system---they constitute ideal targets for a malicious actor and facilitate f ...

ACM2014

ScalaDyno: Making Name Resolution and Type Checking Fault-tolerant

Martin Odersky, Vlad Ureche, Cédric Bastin

The ScalaDyno compiler plugin allows fast prototyping with the Scala programming language, in a way that combines the benefits of both statically and dynamically typed languages. Static name resolution and type checking prevent partially-correct code from ...

ACM2014

Function Identification in Neuron Populations via Information Bottleneck

Michael Christoph Gastpar, Sreenivas Kartik Buddha

It is plausible to hypothesize that the spiking responses of certain neurons represent functions of the spiking signals of other neurons. A natural ensuing question concerns how to use experimental data to infer what kind of a function is being computed. M ...

MDPI AG2013

NoDB: Efficient Query Execution on Raw Data Files

Anastasia Ailamaki, Miguel Sérgio De Oliveira Branco, Ioannis Alagiannis

As data collections become larger and larger, data loading evolves to a major bottleneck. Many applications already avoid using database systems, e.g., scientific data analysis and social networks, due to the complexity and the increased data-to-query time ...

2012

VLSI Implementation of a Low-Complexity LLL Lattice Reduction Algorithm for MIMO Detection

Andreas Peter Burg, Christoph Studer

Lattice-reduction (LR)-aided successive interference cancellation (SIC) is able to achieve close-to optimum error-rate performance for data detection in multiple-input multiple-output (MIMO) wireless communication systems. In this work, we propose a hardwa ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2010

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.

Analyseur LR

Staged parser combinators for efficient data processing

Staged Parser Combinators for Efficient Data Processing

Query management system and engine allowing for efficient query execution on raw details

Accelerating parser combinators with macros

Finding Trojan Message Vulnerabilities in Distributed Systems

ScalaDyno: Making Name Resolution and Type Checking Fault-tolerant

DynaProg for Scala

Function Identification in Neuron Populations via Information Bottleneck

NoDB: Efficient Query Execution on Raw Data Files

VLSI Implementation of a Low-Complexity LLL Lattice Reduction Algorithm for MIMO Detection

Graph Chatbot

Chattez avec Graph Search

Staged Parser Combinators for Efficient Data Processing

Staged parser combinators for efficient data processing

Query management system and engine allowing for efficient query execution on raw details

Finding Trojan Message Vulnerabilities in Distributed Systems

VLSI Implementation of a Low-Complexity LLL Lattice Reduction Algorithm for MIMO Detection

Accelerating parser combinators with macros

NoDB: Efficient Query Execution on Raw Data Files

Function Identification in Neuron Populations via Information Bottleneck

ScalaDyno: Making Name Resolution and Type Checking Fault-tolerant

DynaProg for Scala