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

Peter J. van Otterloo

dblp:10/4402 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
0since 2021 · last 1986
—ORCID · none

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

Artificial intelligence and machine learning · 1 · 1 first-authorHuman-computer interaction and ubiquitous computing · 1Theory 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 · 100%

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

TopicWeightPapersLastEvidence papers
Information theory › signal processing › sampling theory
sampling theorem		 0.011978
A Note on a Sampling Theorem for Simply Connected Closed Contours · Inf. Control. 1978

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

sampling theory · 0.0geometry · 0.0
YearPublicationVenuePosition
1986 Fourier Coding and Reconstruction of Complicated Contours
abstract
Polygonal two-dimensional curves are coded by means of a finite number of their Fourier coefficients and then reconstructed by the corresponding Fourier sums. This mechanism is studied for an interesting class of contours whose members exhibit detail at a wide range of scales. Two bounds (one cheaply computed, one with high performance) are given on the number of Fourier coefficients needed to obtain a given accuracy in a reconstruction.
F. Michel Dekking, Peter J. van Otterloo
 IEEE Trans. Syst. Man Cybern.2
1978 A Note on a Sampling Theorem for Simply Connected Closed Contours
Peter J. van Otterloo, Jan J. Gerbrands
 Inf. Control.1
1978 A distribution-free geometric upper bound for the probability of error of a minimum distance classifier
Peter J. van Otterloo, Ian T. Young
 Pattern Recognit.1