Arithmétique

À propos
Confidentialité
Mentions légales

Graph Chatbot

Publications associées (27)

Solving quantified linear arithmetic by counterexample-guided instantiation

Viktor Kuncak, Andrew Joseph Reynolds

This paper presents a framework to derive instantiation-based decision procedures for satisfiability of quantified formulas in first-order theories, including its correctness, implementation, and evaluation. Using this framework we derive decision procedur ...

2017

Subdomain and Access Pattern Privacy Trading off Confidentiality and Performance

Bin Lu, Thomas Locher, Matus Harvan

Homomorphic encryption and secure multi-party computation enable computations on encrypted data. However, both techniques suffer from a large performance overhead. While advances in algorithms might reduce the overhead, we show that achieving perfect (or e ...

Scitepress2016

Design of Energy-Efficient Discrete Cosine Transform using Pruned Arithmetic Circuits

Christian Enz, Vincent Frédéric Camus, Jérémy Lucien Maurice Schlachter

Inexact circuits and approximate computing have been gaining a lot of interest in order to improve performances and energy efficiency beyond the boundaries of conventional digital circuits. Image and video processing is one of the best candidate for applyi ...

IEEE2016

Improved carry chain mapping for the VTR flow

Paolo Ienne, Grace Zgheib, David Novo Bruna, Ana Petkovska

Carry chains facilitate the implementation of adders and improve the performance of arithmetic circuits in FPGAs. The last version of the commonly used open-source Verilog-to-Routing (VTR) CAD flow now enables modelling carry chains in FPGA architectures. ...

IEEE2015

Energy-Efficient Digital Design Through Inexact and Approximate Arithmetic Circuits

Christian Enz, Vincent Frédéric Camus, Jérémy Lucien Maurice Schlachter

Inexact and approximate circuit design is a promising approach to improve performance and energy efficiency in technology-scaled and low-power digital systems. Such strategy is suitable for error tolerant applications involving perceptive or statistical ou ...

2015

Towards More Efficient Logic Blocks by Exploiting Biconditional Expansion

Giovanni De Micheli, Xifan Tang, Pierre-Emmanuel Julien Marc Gaillardon, Gain Kim, Luca Gaetano Amarù

Nowadays, Field Programmable Gate Arrays (FPGA) exploit Look-Up Tables (LUTs) to generate logic functions. A K-input LUT can implement any Boolean functions with K inputs. Thanks to this flexibility, LUTs remained concep ...

2015

Cohomology Of Large Semiprojective Hyperkahler Varieties

Tamás Hausel

In this paper we survey geometric and arithmetic techniques to study the cohomology of semiprojective hyperkahler manifolds including toric hyperkahler varieties, Nakajima quiver varieties and moduli spaces of Higgs bundles on Riemann surfaces. The resulti ...

Soc Mathematique France2015

Page 2 sur 2