Publications associées à Taille des arbres fruitiers

Structured and tiled-based pruning of Deep Learning models targeting FPGA implementations

Alexandre Schmid, Lizeth Gonzalez Carabarin

Model compression techniques have lead to a reduction of size and number of computations of Deep Learning models. However, techniques such as pruning mostly lack of a real co-optimization with hardware platforms. For instance, implementing unstructured pru ...

IEEE2022

Progressive Correspondence Pruning by Consensus Learning

Mathieu Salzmann, Chenxu Zhao, Hongwei Li, Feng Zhu, Rui Zhao

Correspondence pruning aims to correctly remove false matches (outliers) from an initial set of putative correspondences. The pruning process is challenging since putative matches are typically extremely unbalanced, largely dominated by outliers, and the r ...

IEEE2021

Hardware-oriented pruning and quantization of Deep Learning models to detect life-threatening arrhythmias

Alexandre Schmid, Lizeth Gonzalez Carabarin

Wearable solutions based on Deep Learning (DL) for real-time ECG monitoring are a promising alternative to detect life-threatening arrhythmias. However, DL models suffer of a large memory footprint, which hampers their adoption in portable technologies. Th ...

IEEE2021

A Fast Pruning Technique for Low-Power Inexact Circuit Design

Giovanni De Micheli, Pierre-Emmanuel Julien Marc Gaillardon, Luca Gaetano Amarù, Jaime Joven Murillo, Johan Broc

Inexact Circuits are circuits in which the accuracy of the output can be traded for cost savings (energy, area and/or delay). In the context of advanced technology scaling and power density increase, inexact circuits appear to be very promising as ...

IEEE2015

Automatic Generation of Inexact Digital Circuits by Gate-level Pruning

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

Inexact or approximate circuits show great ability to reduce power consumption at the cost of occasional errors in comparison to their conventional counterparts. Even though the benefits of such circuits have been proven for many applications, they are not ...

2015

Tree-Based Pursuit: Algorithm and Properties

Pascal Frossard, Pierre Vandergheynst, Philippe Jost

This paper proposes a tree-based pursuit algorithm that efficiently trades off complexity and approximation performance for overcomplete signal expansions. Finding the sparsest representation of a signal using a redundant dictionary is, in general, a NP-Ha ...

2006

Branch-and-Prune Search Strategies for Numerical Constraint Solving

Boi Faltings, Marius-Calin Silaghi, Xuan-Ha Vu

When solving numerical constraints such as nonlinear equations and inequalities, solvers often exploit pruning techniques, which remove redundant value combinations from the domains of variables, at pruning steps. To find the complete solution set, most of ...

2005

Tree-Based Pursuit: Algorithm and Properties

Pascal Frossard, Pierre Vandergheynst, Philippe Jost

2005

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.

Taille des arbres fruitiers

Reconstructing lensless image with ML models and deploying them onto embedded systems

Structured and tiled-based pruning of Deep Learning models targeting FPGA implementations

Progressive Correspondence Pruning by Consensus Learning

Hardware-oriented pruning and quantization of Deep Learning models to detect life-threatening arrhythmias

Trustworthy Face Recognition: Improving Generalization of Deep Face Presentation Attack Detection

A Fast Pruning Technique for Low-Power Inexact Circuit Design

Automatic Generation of Inexact Digital Circuits by Gate-level Pruning

Tree-Based Pursuit: Algorithm and Properties

Branch-and-Prune Search Strategies for Numerical Constraint Solving

Tree-Based Pursuit: Algorithm and Properties

Graph Chatbot

Chattez avec Graph Search

Reconstructing lensless image with ML models and deploying them onto embedded systems

Hardware-oriented pruning and quantization of Deep Learning models to detect life-threatening arrhythmias

A Fast Pruning Technique for Low-Power Inexact Circuit Design

Tree-Based Pursuit: Algorithm and Properties

Structured and tiled-based pruning of Deep Learning models targeting FPGA implementations

Progressive Correspondence Pruning by Consensus Learning

Trustworthy Face Recognition: Improving Generalization of Deep Face Presentation Attack Detection

Tree-Based Pursuit: Algorithm and Properties

Automatic Generation of Inexact Digital Circuits by Gate-level Pruning

Branch-and-Prune Search Strategies for Numerical Constraint Solving