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

R. A. Smith

dblp:49/5682 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 1999
—ORCID · none

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

Artificial intelligence and machine learning · 1 · 1 first-authorSystems, architecture and hardware · 1 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 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 architecture, parallel and distributed computing, and storage systems
1 paper
Integrated circuit design · 100%
Theoretical computer science
1 paper
Distributed computing theory · 50% Algorithms and data structures · 50%

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

TopicWeightPapersLastEvidence papers
Integrated circuit design
digital circuit design
0.011965
Minimal Three-Variable NOR and NAND Logic Circuits · IEEE Trans. Electron. Comput. 1965
Integrated circuit design › digital circuit design › logic design
logic circuits
0.011965
Minimal Three-Variable NOR and NAND Logic Circuits · IEEE Trans. Electron. Comput. 1965
Distributed computing theory › distributed algorithms
function computation
0.011965
Minimal Three-Variable NOR and NAND Logic Circuits · IEEE Trans. Electron. Comput. 1965
Algorithms and data structures
table look-up
0.011965
Minimal Three-Variable NOR and NAND Logic Circuits · IEEE Trans. Electron. Comput. 1965

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

minimal logic circuit design · 0.0
YearPublicationVenuePosition
1999 Improving Augmented Reality using Image and Scene Constraints
abstract
The goal of augmented reality is to insert virtual objects into real video sequences. This paper shows that by incorporating image-based geometric constraints over mul-tiple views, we improve on traditional techniques which use purely 3D information. The constraints imposed are chosen to directly target perceptual cues, important to the human visual system, by which errors in AR are most readily perceived. Imposi-tion of the constraints is achieved by constrained maximum-likelihood estimation, and blends projective, affine and Euclidean geometry as appropriate in different cases. We introduce a number of examples of augmented reality tasks, show how image-based constraints can be incorporated into current 3D-based systems, and demonstrate the improvements conferred.
R. A. Smith, Andrew W. Fitzgibbon, Andrew Zisserman
BMVC1
1965 Minimal Three-Variable NOR and NAND Logic Circuits
abstract
Cantor, Estrin and Turn have described a special-purpose structure to implement sequential table look-up (STL) algorithms for the evaluation of ln x and exp x.1 Tables of precomputed constants are used to transform the argument into a range where the function may be approximated by a simple polynomial. The transformation for ln x, originally proposed by Bemer,2 is where the set of constants ai are precomputed. A power series expansion for ln x is
R. A. Smith
IEEE Trans. Electron. Comput.1