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 EDBT 2026 / reviewers in the wild / expert

B. Doherty

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

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

Computer networks · 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.

Computer graphics and multimedia
1 paper
Image and video coding · 100%
Theoretical computer science
1 paper
Information theory · 100%

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

TopicWeightPapersLastEvidence papers
Image and video coding › document image compression
facsimile coding		 0.011980
Comparison of Facsimile Data Compression Schemes · IEEE Trans. Commun. 1980
Information theory › probability theory › stochastic processes › markov processes
markov model		 0.011980
Comparison of Facsimile Data Compression Schemes · IEEE Trans. Commun. 1980

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

markovian modeling · 0.0grammar-based comparison · 0.0
YearPublicationVenuePosition
1980 Comparison of Facsimile Data Compression Schemes
abstract
Ueno et al. [1] developed a strategy for systematic comparison of facsimile data compression schemes based on Markovian models. An extension of this strategy is described which allows systematic comparison with schemes based on non-Markovian grammars, such as relative address coding (RAC).
B. Doherty
 IEEE Trans. Commun.1