Sciweavers

CHI
2002
ACM
14 years 8 months ago
Investigating human-computer optimization
Scheduling, routing, and layout tasks are examples of hardamount of computational effort expended on different subproblems. CHI?2002 This work may not be copied or reproduced in w...
Stacey D. Scott, Neal Lesh, Gunnar W. Klau
CHI
2004
ACM
14 years 8 months ago
Nodding in conversations with a robot
In this demo we describe our ongoing efforts to build a robot that can collaborate with a person in hosting activities. We illustrate our current robot?s conversations, which incl...
Christopher Lee, Neal Lesh, Candace L. Sidner, Lou...
CHI
2005
ACM
14 years 8 months ago
CoR2Ds
We present a new popup widget, called CoR2Ds (Context-Rooted Rotatable Draggables), designed for multi-user direct-touch tabletop environments. CoR2Ds are interactive callout popu...
Chia Shen, Clifton Forlines, Frédéri...
CHI
2005
ACM
14 years 8 months ago
QueryLines: approximate query for visual browsing
We introduce approximate query techniques for searching and analyzing two-dimensional data sets such as line or scatter plots. Our techniques allow users to explore a dataset by d...
Kathy Ryall, Neal Lesh, Tom Lanning, Darren Leigh,...
CHI
2008
ACM
14 years 8 months ago
LivOlay: interactive ad-hoc registration and overlapping of applications for collaborative visual exploration
The interoperability of disparate data types and sources has been a long standing problem and a hindering factor for the efficacy and efficiency in visual exploration applications...
Hao Jiang, Daniel Wigdor, Clifton Forlines, Michel...
CHI
2008
ACM
14 years 8 months ago
Evaluating tactile feedback and direct vs. indirect stylus input in pointing and crossing selection tasks
We present a pair of experiments that explore the effects of tactile-feedback and direct vs. indirect pen input on pointing and crossing selection tasks. While previous work has d...
Clifton Forlines, Ravin Balakrishnan
ICIP
2009
IEEE
14 years 8 months ago
Secure Distortion Computation Among Untrusting Parties Using Homomorphic Encryption
Alice and Bob possess sequences xn and yn respectively and would like to compute d(xn , yn ) where d(., .) is a distortion measure. However, Alice and Bob do not trust each other ...