Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

John K. Petrou

dblp:02/506 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1975
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Processor architecture and microarchitecture · 50% Integrated circuit design · 50%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Processor architecture and microarchitecture
computer arithmetic
0.011975
A Piecewise Linear Approximation of log2x with Equal Maximum Errors in All Intervals · IEEE Trans. Computers 1975
Integrated circuit design
piecewise linear approximation
0.011975
A Piecewise Linear Approximation of log2x with Equal Maximum Errors in All Intervals · IEEE Trans. Computers 1975

Methods — techniques the papers use, named apart from their topics

uniform linear approximation · 0.0minimax approximation · 0.0
YearPublicationVenuePosition
1975 A Piecewise Linear Approximation of log2x with Equal Maximum Errors in All Intervals
abstract
In this paper it is shown how to divide the interval [1,2] into n parts so that the uniform linear approximation of log2x in each subinterval has the same maximum error. This error is, in the case n = 4, smaller by a factor of 2.3 than the error of the linear mean-square approximation given by Hall et al. [1]. The final products of the mathematical analysis are explicit formulas which allow the direct determination of all parameters and the maximum error for any desired number n of subdivisions of [1,2].
John B. Kioustelidis, John K. Petrou
IEEE Trans. Computers2