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

Oscar Buneman

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

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

Applied, interdisciplinary, general and emerging computing · 3 · 2 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
2 papers
Image and video processing · 100%
Theoretical computer science
1 paper
Algorithms and data structures · 100%

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

TopicWeightPapersLastEvidence papers
Image and video processing › image transform
domain transform		 0.011986
Fast two-dimensional Hartley transform · Proc. IEEE 1986
Image and video processing › image transform
hartley transform		 0.011986
Fast two-dimensional Hartley transform · Proc. IEEE 1986
Image and video processing
fast fourier transform		 0.011986
Fast two-dimensional Hartley transform · Proc. IEEE 1986

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

table lookup · 0.0recurrence · 0.0fast transform algorithm · 0.0computational complexity estimation · 0.0
YearPublicationVenuePosition
1987 Multidimensional Hartley transforms
abstract
The computational effort required for multidimensional Hartley transforming is estimated.
Oscar Buneman
 Proc. IEEE1
1987 Stable on-line creation of sines or cosines of successive angles
abstract
Two tables of length log2N suffice for the on-line creation of sines or cosines of N successive angles, With only one addition and one multiplication per step.
Oscar Buneman
 Proc. IEEE1
1986 Fast two-dimensional Hartley transform
abstract
The fast Hartley transform algorithm introduced in 1984 offers an alternative to the fast Fourier transform, with the advantages of not requiring complex arithmetic or a sign change of i to distinguish inverse transformation from direct. A two-dimensional extension is described that speeds up Fourier transformation of real digital images.
Ronald N. Bracewell, Oscar Buneman, Hong Hao, J. Villasenor
 Proc. IEEE2