Sciweavers

561 search results - page 59 / 113
» A Strategy for the Computation of Conditional Answers
Sort
View
CHI
1998
ACM
14 years 1 months ago
Exploring Browser Design Trade-Offs Using a Dynamical Model of Optimal Information Foraging
Designers and researchers of human-computer interaction need tools that permit the rapid exploration and management of hypotheses about complex interactions of designs, task condi...
Peter Pirolli
CHI
1997
ACM
14 years 1 months ago
Cognitive Modeling Reveals Menu Search is Both Random and Systematic
To understand how people search for a known target item in an unordered pull-down menu, this research presents cognitive models that vary serial versus parallel processing of menu...
Anthony J. Hornof, David E. Kieras
ICRA
2006
IEEE
90views Robotics» more  ICRA 2006»
14 years 3 months ago
A Performance Comparison of Three Algorithms for Proximity Queries Relative to Convex Polyhedra
— This paper presents a comparative analysis relative to the experimental performances of an asymptotically fast and incremental algorithm, recently developed to compute collisio...
Stefano Carpin, Claudio Mirolo, Enrico Pagello
PODS
2008
ACM
178views Database» more  PODS 2008»
14 years 9 months ago
The chase revisited
We revisit the classical chase procedure, studying its properties as well as its applicability to standard database problems. We settle (in the negative) the open problem of decid...
Alin Deutsch, Alan Nash, Jeffrey B. Remmel
SIGMOD
2004
ACM
262views Database» more  SIGMOD 2004»
14 years 9 months ago
The Next Database Revolution
Database system architectures are undergoing revolutionary changes. Most importantly, algorithms and data are being unified by integrating programming languages with the database ...
Jim Gray