z-logo
open-access-imgOpen Access
Finding maximal and minimal elements in a set is capacity-unlimited and massively-parallel
Author(s) -
Edwina L. Picon,
Darko Odic
Publication year - 2017
Publication title -
journal of vision
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.126
H-Index - 113
ISSN - 1534-7362
DOI - 10.1167/17.10.1284
Subject(s) - pairwise comparison , line (geometry) , set (abstract data type) , computation , element (criminal law) , computer science , sequence (biology) , dimension (graph theory) , representation (politics) , combinatorics , identification (biology) , algorithm , mathematics , arithmetic , artificial intelligence , biology , genetics , law , botany , geometry , politics , political science , programming language

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom