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

H. L. Nyo

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

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

Applied, interdisciplinary, general and emerging computing · 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 processing · 100%

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

TopicWeightPapersLastEvidence papers
Image and video processing
pattern matching		 0.011986
A polynomial time algorithm for subpattern matching · Proc. IEEE 1986

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

ellipsoid algorithm · 0.0bounding regions · 0.0
YearPublicationVenuePosition
1986 A polynomial time algorithm for subpattern matching
abstract
An O(N3K) time algorithm for searching matches of a template of size K in an image of size N is given. It uses bounding regions and the Soviet Ellipsoid Algorithm [1]. It will work under moderately heavy shift noise.
H. L. Nyo, Minsoo Suk
 Proc. IEEE1