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

Senol Küçük

dblp:142/3969 · DBLP profile ↗
← Back
2ranked-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 · 2Graphics, computer vision, multimedia, augmented reality and games · 2

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 architecture, parallel and distributed computing, and storage systems
1 paper
Reconfigurable computing and FPGAs · 77% Parallel and multicore computing · 23%

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

TopicWeightPapersLastEvidence papers
Reconfigurable computing and FPGAs › FPGA-based signal processing
FPGA-based image processing		 0.011993
Wavelet transform embeddings in mesh architectures · CVPR 1993

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

wavelet transform · 0.0embedding algorithms · 0.0
YearPublicationVenuePosition
1993 Wavelet transform embeddings in mesh architectures
abstract
To efficiently use wavelet transforms in parallel mesh architectures, it is necessary to identify efficient embeddings of wavelet transform coefficients into such meshes. Two forms of 2D wavelet transform embedding into 2D meshes (with and without reconfigurability) are considered, and time performances for these embeddings over classes of image processing algorithms are compared. This demonstrates the superiority of one of these embeddings.>
Richard W. Hall, Senol Küçük, Mounir Hamdi
 CVPR2
1992 Parallel 3D shrinking algorithms using subfields notions
abstract
The parallel shrinking of 3D binary images to single point residues is addressed using two subfields notions (A subfield is a partition of the image space into two disjoint subsets). Sufficient conditions for connectivity preservation are developed and convergence issues are discussed. An example two subfields algorithm is illustrated and evaluated.>
Richard W. Hall, Senol Küçük
 ICPR (1)2