8695 search results - page 31 / 1739 » Making the Complex Simple |
NIPS
2004
13 years 9 months ago
2004
Simple lexicographic decision heuristics that consider cues one at a time in a particular order and stop searching for cues as soon as a decision can be made have been shown to be...
STOC
2007
ACM
14 years 8 months ago
2007
ACM
The quantum adversary method is one of the most successful techniques for proving lower bounds on quantum query complexity. It gives optimal lower bounds for many problems, has ap...
COGSCI
2010
13 years 8 months ago
2010
We examine the verification of simple quantifiers in natural language from a computational model perspective. We refer to previous neuropsychological investigations of the same pr...
IV
1999
IEEE
14 years 8 days ago
1999
IEEE
The Reorderable Matrix is a simple visualization method for quantitative tabular data. This paper examines how first-time users interact with the Reorderable Matrix and how well t...
FGR
1996
IEEE
14 years 5 days ago
1996
IEEE
As autonomous robots become increasingly adept at performing simple tasks like moving from place to place and picking up and delivering objects, it is becoming apparent that an im...