Sciweavers

11589 search results - page 2255 / 2318
» Human computation
Sort
View
SOUPS
2009
ACM
15 years 4 months ago
A "nutrition label" for privacy
We used an iterative design process to develop a privacy label that presents to consumers the ways organizations collect, use, and share personal information. Many surveys have sh...
Patrick Gage Kelley, Joanna Bresee, Lorrie Faith C...
CSCW
2010
ACM
15 years 2 months ago
Sending mixed signals: multilevel reputation effects in peer-to-peer lending markets
Online peer-to-peer (P2P) lending organizations enable an individual to obtain an unsecured loan from a collection of individuals without the participation of a bank. Previous res...
Benjamin C. Collier, Robert Hampshire
CCS
2009
ACM
15 years 2 months ago
Multiple password interference in text passwords and click-based graphical passwords
The underlying issues relating to the usability and security of multiple passwords are largely unexplored. However, we know that people generally have difficulty remembering mult...
Sonia Chiasson, Alain Forget, Elizabeth Stobert, P...
WDAG
1989
Springer
62views Algorithms» more  WDAG 1989»
15 years 1 months ago
Possibility and Impossibility Results in a Shared Memory Environment
We focus on unreliable asynchronous shared memory model which support only atomic read and write operations. For such a model we provide a necessary condition for the solvability ...
Gadi Taubenfeld, Shlomo Moran
76
Voted
WDAG
1990
Springer
80views Algorithms» more  WDAG 1990»
15 years 1 months ago
Tight Bounds on the Round Complexity of Distributed 1-Solvable Tasks
A distributed task T is 1-solvable if there exists a protocol that solves it in the presence of (at most) one crash failure. A precise characterization of the 1-solvable tasks was...
Ofer Biran, Shlomo Moran, Shmuel Zaks
« Prev « First page 2255 / 2318 Last » Next »