Sciweavers

643 search results - page 89 / 129
» A study of computational and human strategies in revelation ...
Sort
View
SODA
2010
ACM
190views Algorithms» more  SODA 2010»
14 years 5 months ago
One-Counter Markov Decision Processes
We study the computational complexity of some central analysis problems for One-Counter Markov Decision Processes (OC-MDPs), a class of finitely-presented, countable-state MDPs. O...
Tomas Brazdil, Vaclav Brozek, Kousha Etessami, Ant...
CHI
2006
ACM
14 years 8 months ago
Why phishing works
To build systems shielding users from fraudulent (or phishing) websites, designers need to know which attack strategies work and why. This paper provides the first empirical evide...
Rachna Dhamija, J. D. Tygar, Marti A. Hearst
ICALP
1994
Springer
13 years 11 months ago
On the Cost of Recomputing: Tight Bounds on Pebbling with Faults
We introduce a formal framework to study the time and space complexity of computing with faulty memory. For the fault-free case, time and space complexities were studied using the...
Yonatan Aumann, Judit Bar-Ilan, Uriel Feige
CHI
2005
ACM
14 years 8 months ago
Multi-monitor mouse
Multiple-monitor computer configurations significantly increase the distances that users must traverse with the mouse when interacting with existing applications, resulting in inc...
Hrvoje Benko, Steven Feiner
TABLETOP
2006
IEEE
14 years 1 months ago
Extending Tabletops to Support Flexible Collaborative Interactions
Tabletops have been used to support a range of colocated activities, from games to image sorting. However, their limited display space and resolution can restrict the kinds of col...
Yvonne Rogers, Youn-Kyung Lim, William R. Hazlewoo...