Showing papers by "Peter A. Gloor published in 1993"
01 Sep 1993
TL;DR: This paper proposes a melding of the common direct manipulation interfaces with a programming language which is enhanced to manipulate digital audio and video, which results in a system which can automate routine tasks as well as perform tasks based on sophisticated media recognition algorithms.
Abstract: The recent development of powerful, inexpensive hardware and software support has made digital video editing possible on personal computers and workstations. To date the video editing application category has been dominated by visual, easy-to-use, direct manipulation interfaces. These systems bring high-bandwidth human-computer interaction to a task formerly characterized by slow, inflexible, indirectlyoperated machines. However, the direct manipulation computer interfaces are limited by their manual nature, and can not easily accomodate algorithmically-defined operations. This paper proposes a melding of the common direct manipulation interfaces with a programming language which we have enhanced to manipulate digital audio and video. The result is a system which can automate routine tasks as well as perform tasks based on sophisticated media recognition algorithms.
37 citations
Book•
01 Jan 1993
TL;DR: Animated algorithms asymptotic notation recursion simple data structures sorting algorithms and analysis hashing binary trees red-black trees minimum spanning trees single-source shortest paths Fibonacci heaps.
Abstract: Animated algorithms asymptotic notation recursion simple data structures sorting algorithms and analysis hashing binary trees red-black trees minimum spanning trees single-source shortest paths Fibonacci heaps Huffman encoding dynamic programming matrix multiplication matrix inverse convex hull genetic algorithms neural networks.
10 citations
01 Mar 1993
TL;DR: This work describes the hashing algorithm part of a large scale project focusing on algorithm animation for computer science education and describes how to visualize algorithm analysis and outline the scripting facility to support the generation of hashing animations.
Abstract: We address the conceptual problem of how to visualize computer science algorithms by describing the hashing algorithm part of a large scale project focusing on algorithm animation for computer science education. We concentrate on the two tasks of how to visualize data objects and operations on those objects and illustrate our findings by discussing extensive examples of hashing animations. We also describe how to visualize algorithm analysis and outline the scripting facility to support the generation of hashing animations.
1 citations
06 Nov 1993
TL;DR: The authors describe Animated Algorithms, a hypermedia learning environment providing an ideal format for the visual explanation of complex algorithms contained in the book Introduction to Al algorithms by T.H. Cormen, et al. (1990).
Abstract: The authors present a multimedia system for computer science education that illustrates a new class of educational multimedia applications characterized by a seamless integration of different multimedia data types. The combination of hypertext, computer animation, and digital video results in an interactive hypermedia learning environment impossible to realize before the advent of multimedia technology. The authors describe Animated Algorithms, a hypermedia learning environment providing an ideal format for the visual explanation of complex algorithms contained in the book Introduction to Algorithms by T.H. Cormen, et al. (1990). It consists of three interactive components: a hypertext version of the book itself, animations of the most important algorithms, and movies explaining the use of the hypertext interface and the animations. >