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.

Joel Auslander

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

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

Software engineering, systems software and programming languages · 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.

Software engineering, system software, and programming languages
1 paper
Runtime systems and virtual machines · 56% Compilers and program optimization · 44%
Computer graphics and multimedia
1 paper
Computer animation and physical simulation · 100%

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

TopicWeightPapersLastEvidence papers
Runtime systems and virtual machines
dynamic compilation
0.011996
Fast, Effective Dynamic Compilation · PLDI 1996
Computer animation and physical simulation › character animation
articulated figure animation
0.011995
Further Experience with Controller-Based Automatic Motion Synthesis for Articulated Figures · ACM Trans. Graph. 1995
Computer animation and physical simulation
motion synthesis
0.011995
Further Experience with Controller-Based Automatic Motion Synthesis for Articulated Figures · ACM Trans. Graph. 1995
Runtime systems and virtual machines › dynamic compilation
just-in-time compilation
0.011996
Fast, Effective Dynamic Compilation · PLDI 1996

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

data flow analysis · 0.0constant propagation · 0.0code templates · 0.0automatic motion synthesis algorithm · 0.0
YearPublicationVenuePosition
1996 Fast, Effective Dynamic Compilation
abstract
Dynamic compilation enables optimization based on the values of invariant data computed at run-time. Using the values of these run-time constants, a dynamic compiler can eliminate their memory loads, perform constant propagation and folding, remove branches they determine, and fully unroll loops they bound. However, the performance benefits of the more efficient, dynamically-compiled code are offset by the run-time cost of the dynamic compile. Our approach to dynamic compilation strives for both fast dynamic compilation and high-quality dynamically-compiled code: the programmer annotates regions of the programs that should be compiled dynamically; a static, optimizing compiler automatically produces pre-optimized machine-code templates, using a pair of dataflow analyses that identify which variables will be constant at run-time; and a simple, dynamic compiler copies the templates, patching in the computed values of the run-time constants, to produce optimized, executable code. Our work targets general- purpose, imperative programming languages, initially C. Initial experiments applying dynamic compilation to C programs have produced speedups ranging from 1.2 to 1.8.
Joel Auslander, Matthai Philipose, Craig Chambers, Susan J. Eggers, Brian N. Bershad
PLDI1
1995 Further Experience with Controller-Based Automatic Motion Synthesis for Articulated Figures
abstract
We extend an earlier automatic motion-synthesis algorithm for physically realistic articulated figures in several ways. First, we summarize several incremental improvements to the original algorithm that improve its efficiency significantly and provide the user with some ability to influence what motions are generated. These techniques can be used by an animator to achieve a desired movement style, or they can be used to guarantee variety in the motions synthesized over several runs of the algorithm. Second, we report on new mechanisms that support the concatenation of existing, automatically generated motion controllers to produce complex, composite movement. Finally, we describe initial work on generalizing the techniques from 2D to 3D articulated figures. Taken together, these results illustrate the promise and challenges afforded by the controller-based approach to automatic motion synthesis for computer animation.
Joel Auslander, Alex S. Fukunaga, Hadi Partovi, Jon Christensen, Lloyd Hsu, Peter Reiss, Andrew Shuman, Joe Marks, J. Thomas Ngo
ACM Trans. Graph.1