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

Jens Breckling

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

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

Artificial intelligence and machine learning · 1

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
Audio and music processing · 50% Image and video coding · 50%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Hardware accelerators and domain-specific architectures · 100%

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

TopicWeightPapersLastEvidence papers
Image and video coding › quantization › vector quantization
codebook design		 0.011993
Systolic codebook generation [speech recognition] · IEEE Trans. Speech Audio Process. 1993
Audio and music processing
speech recognition		 0.011993
Systolic codebook generation [speech recognition] · IEEE Trans. Speech Audio Process. 1993

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

linear predictive coding · 0.0clustering · 0.0
YearPublicationVenuePosition
1993 Systolic codebook generation [speech recognition]
abstract
Two systolic codebook generators which are based on finding clusters in a multidimensional space with a suitable dissimilarity measure are presented. They are implemented on two novel VLSI architectures. For segments of speech represented by a sequence of k linear-predictive-coding vectors, the first version finds r large clusters in time O(rk), and the second version finds the maximal r clusters in time O(r log k).>
Bryan Beresford-Smith, Jens Breckling, Heiko Schröder 0001, Peter F. Summons
 IEEE Trans. Speech Audio Process.2