A Polynomial Time Algorithm for Solving the Word-length Optimization Problem - Archive ouverte HAL Access content directly
Conference Papers Year : 2013

A Polynomial Time Algorithm for Solving the Word-length Optimization Problem

(1) , (2) , (1)
1
2

Domains

Computer Science [cs] Signal and Image Processing Engineering Sciences [physics] Signal and Image processing

Daniel Menard  : Connect in order to contact the contributor

https://hal.inria.fr/hal-00876132

Submitted on : Wednesday, October 23, 2013-5:32:18 PM

Last modification on : Wednesday, April 27, 2022-4:09:16 AM

Not file

Dates and versions

hal-00876132 , version 1 (23-10-2013)

Identifiers

  • HAL Id : hal-00876132 , version 1

Cite

Karthick Parashar, Daniel Menard, Olivier Sentieys. A Polynomial Time Algorithm for Solving the Word-length Optimization Problem. IEEE/ACM International Conference on Computer-Aided Design (ICCAD), Nov 2013, San Diego, United States. ⟨hal-00876132⟩

Export

BibTeX TEI Dublin Core DC Terms EndNote Datacite

Collections

UNIV-NANTES INSTITUT-TELECOM EC-PARIS UNIV-RENNES1 CNRS INRIA INSA-RENNES IRISA IETR IETR-INSA IRISA-D3 INRIA2 UR1-MATH-STIC UR1-UFR-ISTIC IETR-VAADER UNIV-RENNES INSA-GROUPE UR1-MATH-NUM NANTES-UNIVERSITE
299 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More