Iteration Abstraction in SatherSTEPHAN MURER , STEPHEN OMOHUNDRO

Sather Iters: Object-oriented Iteration Abstraction

Sather iters are a powerful new way to encapsulate iteration. We argue that such iteration abstractions belong in a class' interface on an equal footing with its routines. Sather iters were derived from CLU iterators but are much more exible and better suited for object-oriented programming. We motivate and describe the construct along with several simple examples. We compare it with iteration ...

Iteration Abstraction in

Sather extends the notion of an iterator in a powerful new way. We argue that iteration abstractions belong in class interfaces on an equal footing with routines. Sather iterators were derived from CLU iterators but are much more exible and better suited for object-oriented programming. We retain the property that iterators are structured, i.e. strictly bound to a controlling structured stateme...

Building Faster Connectionist Systems With Bumptrees

0 Efficient Visual Search : A Connectionist Solution 1

Searching for objects in scenes is a natural task for people and has been extensively studied by psychologists. In this paper we examine this task from a connectionist perspective. Computational complexity arguments suggest that parallel feed-forward networks cannot perform this task efficiently. One difficulty is that, in order to distinguish the target from distractors, a combination of featu...

A Network for Extracting the Locations of Point Clusters Using Selective Attention 1

This report explores the problem of dynamically computing visual relations in connectionist systems. It concentrates on the task of learning whether three clumps of points in a 256x256 image form an equilateral triangle. We argue that feed-forward networks for solving this task would not scale well to images of this size. One reason for this is that local information does not contribute to the ...