default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVincent Camus
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j3]Vincent Camus
, Linyan Mei, Christian C. Enz, Marian Verhelst:
Review and Benchmarking of Precision-Scalable Multiply-Accumulate Unit Architectures for Embedded Neural-Network Processing. IEEE J. Emerg. Sel. Topics Circuits Syst. 9(4): 697-711 (2019)- [c12]Vincent Camus, Christian C. Enz, Marian Verhelst:
Survey of Precision-Scalable Multiply-Accumulate Units for Neural-Network Processing. AICAS 2019: 57-61 - 2018
- [j2]Vincent Camus, Mattia Cacciotti, Jeremy Schlachter, Christian C. Enz:
Design of Approximate Circuits by Fabrication of False Timing Paths: The Carry Cut-Back Adder. IEEE J. Emerg. Sel. Topics Circuits Syst. 8(4): 746-757 (2018) - [c11]Justine Bonnot, Vincent Camus, Karol Desnos, Daniel Ménard:
Cassis: Characterization with Adaptive Sample- Size Inferential Statistics Applied to Inexact Circuits. EUSIPCO 2018: 677-681 - [c10]Mattia Cacciotti, Vincent Camus, Jeremy Schlachter, Alessandro Pezzotta, Christian C. Enz:
Hardware Acceleration of HDR-Image Tone Mapping on an FPGA-CPU Platform Through High-Level Synthesis. SoCC 2018: 158-162 - 2017
- [j1]Jeremy Schlachter, Vincent Camus, Krishna V. Palem, Christian C. Enz:
Design and Applications of Approximate Circuits by Gate-Level Pruning. IEEE Trans. Very Large Scale Integr. Syst. 25(5): 1694-1702 (2017) - [c9]Xun Jiao, Vincent Camus, Mattia Cacciotti, Yu Jiang, Christian C. Enz, Rajesh K. Gupta:
Combining structural and timing errors in overclocked inexact speculative adders. DATE 2017: 482-487 - [c8]Marta Franceschi, Vincent Camus, Ali Ibrahim, Christian C. Enz, Maurizio Valle:
Approximate FPGA Implementation of CORDIC for Tactile Data Processing Using Speculative Adders. NGCAS 2017: 41-44 - 2016
- [c7]Vincent Camus, Jeremy Schlachter, Christian C. Enz:
A low-power carry cut-back approximate adder with fixed-point implementation and floating-point precision. DAC 2016: 127:1-127:6 - [c6]Vincent Camus, Jeremy Schlachter, Christian C. Enz, Michael Gautschi, Frank K. Gürkaynak:
Approximate 32-bit floating-point unit design with 53% power-area product reduction. ESSCIRC 2016: 465-468 - [c5]Jeremy Schlachter, Vincent Camus, Christian C. Enz:
Design of energy-efficient discrete cosine transform using pruned arithmetic circuits. ISCAS 2016: 341-344 - 2015
- [c4]Vincent Camus, Jeremy Schlachter, Christian C. Enz:
Energy-efficient inexact speculative adder with high performance and accuracy control. ISCAS 2015: 45-48 - [c3]Jeremy Schlachter, Vincent Camus, Christian C. Enz, Krishna V. Palem:
Automatic generation of inexact digital circuits by gate-level pruning. ISCAS 2015: 173-176 - [c2]Jeremy Schlachter, Vincent Camus, Christian C. Enz:
Near/Sub-Threshold Circuits and Approximate Computing: The Perfect Combination for Ultra-Low-Power Systems. ISVLSI 2015: 476-480 - [c1]Vincent Camus, Jeremy Schlachter, Christian C. Enz:
Energy-efficient digital design through inexact and approximate arithmetic circuits. NEWCAS 2015: 1-4
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:52 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
