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
Demo Data from SIGIR 2026 / reviewers in the wild / expert

Novellone Rozario

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

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

Theory of computation · 1 · 1 first-author

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
1 paper
Information theory · 87% Mathematical optimization · 13%

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

TopicWeightPapersLastEvidence papers
Information theory › signal processing › spectral estimation
maximum entropy spectrum		 0.011987
Spectral estimation from nonconsecutive data · IEEE Trans. Inf. Theory 1987
Information theory › signal processing
spectral estimation		 0.011987
Spectral estimation from nonconsecutive data · IEEE Trans. Inf. Theory 1987

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

steepest ascent · 0.0levinson's algorithm · 0.0
YearPublicationVenuePosition
1987 Spectral estimation from nonconsecutive data
abstract
A method is presented for determining the maximum entropy spectrumS(\omega)of a process under the constraint that its autocorrelationR(m)is known for everymin a setDof nonconsecutive integers. The method involves a simple steepest ascent technique that is based entirely on Levinson's algorithm.
Novellone Rozario, Athanasios Papoulis
 IEEE Trans. Inf. Theory1