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

Robert G. Laughlin

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

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

Artificial intelligence and machine learning · 1Systems, architecture and hardware · 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 architecture, parallel and distributed computing, and storage systems
1 paper
Parallel and multicore computing · 100%

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

TopicWeightPapersLastEvidence papers
Parallel and multicore computing
parallel algorithms		 0.011991
Parallel algorithms for line detection on a 1×N array processor · ICRA 1991
Parallel and multicore computing › parallel algorithms
parallel image processing		 0.011991
Parallel algorithms for line detection on a 1×N array processor · ICRA 1991
Parallel and multicore computing
array processor		 0.011991
Parallel algorithms for line detection on a 1×N array processor · ICRA 1991

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

hough transform · 0.0
YearPublicationVenuePosition
1991 Parallel algorithms for line detection on a 1×N array processor
abstract
A description is given of two algorithms that compute the Hough transform for straight lines on N*N images using 1*N processing arrays. The algorithms are developed for 1*N array processors and have been implemented on the AIS-5000 parallel vision computer. The complexity of both algorithms is O(N/sup 2/+PN) on the 1*N array processor (P is the number of angles polled which determines the theta -resolution of the Hough space), which compares well with the known optimal O(N+P) algorithms for N*N mesh arrays.>
Ze-Nian Li, Robert G. Laughlin
 ICRA3