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

Kwang H. Paick

dblp:08/185 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 1995
—ORCID · none

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

Theory of computation · 2

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.

Theoretical computer science
2 papers
Information theory · 96% Mathematical optimization · 4%

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

TopicWeightPapersLastEvidence papers
Information theory › information measures
entropy and divergence measures
0.021995
Information-theoretic approach to unimodal density estimation · IEEE Trans. Inf. Theory 1995
Computation of minimum cross entropy spectral estimates: An unconstrained dual convex programming method · IEEE Trans. Inf. Theory 1986
Information theory › estimation theory
density estimation
0.011995
Information-theoretic approach to unimodal density estimation · IEEE Trans. Inf. Theory 1995
Information theory › information measures › entropy
maximum entropy
0.011995
Information-theoretic approach to unimodal density estimation · IEEE Trans. Inf. Theory 1995
Information theory
minimum cross-entropy
0.011986
Computation of minimum cross entropy spectral estimates: An unconstrained dual convex programming method · IEEE Trans. Inf. Theory 1986
Information theory › signal processing
spectral estimation
0.011986
Computation of minimum cross entropy spectral estimates: An unconstrained dual convex programming method · IEEE Trans. Inf. Theory 1986
Mathematical optimization › continuous optimization › convex optimization
convex duality
0.011986
Computation of minimum cross entropy spectral estimates: An unconstrained dual convex programming method · IEEE Trans. Inf. Theory 1986
Mathematical optimization › continuous optimization
convex optimization
0.011986
Computation of minimum cross entropy spectral estimates: An unconstrained dual convex programming method · IEEE Trans. Inf. Theory 1986

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

quantile constraints · 0.0moment constraints · 0.0nonlinear programming · 0.0convex programming · 0.0
YearPublicationVenuePosition
1995 Information-theoretic approach to unimodal density estimation
abstract
Extends the maximum entropy information-theoretic density estimation method to provide a technique which guarantees that the resulting density is unimodal. The method inputs data in the form of moment or quantile constraints and consequently can handle both data-derived and non-data-derived information.>
Patrick L. Brockett, Abraham Charnes, Kwang H. Paick
IEEE Trans. Inf. Theory3
1986 Computation of minimum cross entropy spectral estimates: An unconstrained dual convex programming method
abstract
The minimum cross entropy spectral analysis procedure (a generalization of maximum entropy spectral analysis) is formulated as a convex programming problem, and its unconstrained dual convex programming problem is shown. In this dual setting the Lagrange multipliers are precisely the dual variables, and the numerical solution values are easily determined by any of a number of nonlinear programming codes. This result vastly simplifies the computation of all such spectral density estimates.
Patrick L. Brockett, Abraham Charnes, Kwang H. Paick
IEEE Trans. Inf. Theory3