Computational Foundations for Attentive Processes

Neurobiology of Attention

Volumn , Issue , 2005, Pages 3-7

  Tsotsos, John K ^a  

^a YORK UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 56749169263     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1016/B978-012375731-9/50005-7     Document Type: Chapter

References (10)

1. M. Davis (1958) Computability and Unsolvability. McGraw-Hill
2. M. Davis (1965) The Undecidable. New York: Hewlett Raven Press
3. M. Garey and D. Johnson (1979) Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman
4. P. Parodi, R. Lancewicki, A. Vijh and J.K. Tsotsos (1998) Empirically-derived estimates of the complexity of labelling line drawings of polyhedral scenes. Artif. Intell. 105 47-75.
5. R. Rensink (1989) A New Proof of the NP-Completeness of Visual Match. San Francisco: Dept. of Computer Science, University of British Columbia Technical Rep. 89-22
6. L. Stockmeyer and A. Chandra (1988) Intrinsically difficult problems. Trends in Computing Vol. 1 Scientific American Inc. 88-97.
7. J.K. Tsotsos (1987) A complexity level' analysis of vision. Proceedings, International Conference on Computer Vision, London, England
8. J.K. Tsotsos (1988) How does human vision beat the computational complexity of visual perception? Z. Pylyshyn (Ed.) Computational Processes in Human Vision: An Interdisciplinary Perspective New York: Ablex Press 286-338.
9. J.K. Tsotsos (1989) The complexity of perceptual search tasks. Proceedings, International Joint Conference on Artificial Intelligence, Detroit, Michigan 1571-1577.
10. J.K. Tsotsos (1990) A complexity level analysis of vision. Behav. Brain Sci. 13 423-455.