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

Simon T. Dekker

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

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

Artificial intelligence and machine learning · 2 · 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
Multimedia analysis and retrieval · 50% Image and video processing · 50%
Theoretical computer science
2 papers
Graph algorithms and graph theory · 67% Logic in computer science · 18% Algorithms and data structures · 15%
Artificial intelligence
1 paper
Knowledge representation and reasoning · 100%

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

TopicWeightPapersLastEvidence papers
Knowledge, reasoning and agents › Knowledge representation and reasoning
epistemic reasoning		 0.011990
Perfect Knowledge Revisited · Artif. Intell. 1990
Image and video processing › mathematical morphology
distance transform		 0.011989
An Efficient Uniform Cost Algorithm Applied to Distance Transforms · IEEE Trans. Pattern Anal. Mach. Intell. 1989
Multimedia analysis and retrieval
image analysis		 0.011989
An Efficient Uniform Cost Algorithm Applied to Distance Transforms · IEEE Trans. Pattern Anal. Mach. Intell. 1989
Graph algorithms and graph theory › graph algorithms › path problems
shortest path algorithms		 0.011989
An Efficient Uniform Cost Algorithm Applied to Distance Transforms · IEEE Trans. Pattern Anal. Mach. Intell. 1989
Logic in computer science
epistemic logic		 0.011990
Perfect Knowledge Revisited · Artif. Intell. 1990
Algorithms and data structures › search algorithms › heuristic search
a* search		 0.011989
An Efficient Uniform Cost Algorithm Applied to Distance Transforms · IEEE Trans. Pattern Anal. Mach. Intell. 1989
Graph algorithms and graph theory › graph algorithms
graph search		 0.011989
An Efficient Uniform Cost Algorithm Applied to Distance Transforms · IEEE Trans. Pattern Anal. Mach. Intell. 1989

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

epistemic logic · 0.0integer cost optimization · 0.0bucket sort · 0.0
YearPublicationVenuePosition
1990 Perfect Knowledge Revisited
Simon T. Dekker, H. Jaap van den Herik, I. S. Herschberg
 Artif. Intell.1
1989 An Efficient Uniform Cost Algorithm Applied to Distance Transforms
abstract
The uniform-cost algorithm is a special case of the A*-algorithm for finding the shortest paths in graphs. In the uniform-cost algorithm, nodes are expanded in order of increasing cost. An efficient version of this algorithm is developed for integer cost values. Nodes are sorted by storing them at predefined places (bucket sort), keeping the overhead low. The algorithm is applied to general distance transformation. A constrained distance transform is an operation which calculates at each pixel of an image the distance to the nearest pixel of a reference set, distance being defined as minimum path length. The uniform-cost algorithm, in the constrained case, proves to be the best solution for distance transformation. It is fast, the processing time is independent of the complexity of the image, and memory requirements are moderate.>
Ben J. H. Verwer, Piet W. Verbeek, Simon T. Dekker
 IEEE Trans. Pattern Anal. Mach. Intell.3