An approximate algorithm for the multiple constant multiplications problem.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/sbcci/AksoyG08
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/sbcci/AksoyG08
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Ece_Olcay_G%E2%88%9A%C4%BEnes
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Levent_Aksoy
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1145%2F1404371.1404395
>
foaf:
homepage
<
https://doi.org/10.1145/1404371.1404395
>
dc:
identifier
DBLP conf/sbcci/AksoyG08
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1145%2F1404371.1404395
(xsd:string)
dcterms:
issued
2008
(xsd:gYear)
rdfs:
label
An approximate algorithm for the multiple constant multiplications problem.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Ece_Olcay_G%E2%88%9A%C4%BEnes
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Levent_Aksoy
>
swrc:
pages
58-63
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/sbcci/2008
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/sbcci/AksoyG08/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/sbcci/AksoyG08
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/sbcci/sbcci2008.html#AksoyG08
>
rdfs:
seeAlso
<
https://doi.org/10.1145/1404371.1404395
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/sbcci
>
dc:
subject
approximate algorithm, graph-based technique, multiple constant multiplications problem, multiplierless filter design
(xsd:string)
dc:
title
An approximate algorithm for the multiple constant multiplications problem.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document