The complexity of perceptual search tasks

Authors:
John K. Tsotsos
Affiliations:
Department of Computer Science, University of Toronto, Toronto, Ontario, Canada
Venue:
IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 2
Year:
1989

Citing 3
Cited 7

The complexity of some polynomial network consistency algorithms for constraint satisfaction problems

Artificial Intelligence
The combinatorics of local constraints in model-based recognition and localization from sparse data

Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

A Cooperating Strategy for Objects Recognition

Shape, Contour and Grouping in Computer Vision
Attending to visual motion

Computer Vision and Image Understanding - Special issue: Attention and performance in computer vision
Familiarity based unified visual attention model for fast and robust object recognition

Pattern Recognition
Visual search for an object in a 3D environment using a mobile robot

Computer Vision and Image Understanding
Combining approximate front end signal processing with selective reprocessing in auditory perception

AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Localization of attended multi-feature stimuli: tracing back feed-forward activation using localized saliency computations

ICANN'06 Proceedings of the 16th international conference on Artificial Neural Networks - Volume Part II
Does intelligence imply contradiction?

Cognitive Systems Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

Model-based revision of knowledge bases expressed as first-order theories was shown in [Winslett 88b] to be useful as a means of describing and reasoning about the effects of actions. This paper shows that model-based theory revision is actually expressible ...