Sciweavers

1192 search results - page 26 / 239
» Computing Weakest Readings
Sort
View
ICDCS
2010
IEEE
15 years 1 months ago
Using Analog Network Coding to Improve the RFID Reading Throughput
Abstract—RFID promises to revolutionize the inventory management in large warehouses, retail stores, hospitals, transportation systems, etc. Periodically reading the IDs of the t...
Ming Zhang, Tao Li, Shigang Chen, Bo Li
CHI
2006
ACM
16 years 4 days ago
Visual search and reading tasks using ClearType and regular displays: two experiments
Two experiments comparing user performance on ClearType and Regular displays are reported. In the first, 26 participants scanned a series of spreadsheets for target information. S...
Andrew Dillon, Lisa Kleinman, Gil Ok Choi, Randolp...
CSCW
2010
ACM
15 years 8 months ago
Readers are not free-riders: reading as a form of participation on wikipedia
The success of Wikipedia as a large-scale collaborative effort has spurred researchers to examine the motivations and behaviors of Wikipedia’s participants. However, this resear...
Judd Antin, Coye Cheshire
96
Voted
DSN
2006
IEEE
15 years 3 months ago
Lucky Read/Write Access to Robust Atomic Storage
This paper establishes tight bounds on the best-case time-complexity of distributed atomic read/write storage implementations that tolerate worst-case conditions. We study asynchr...
Rachid Guerraoui, Ron R. Levy, Marko Vukolic
105
Voted
PODC
2010
ACM
14 years 12 months ago
The k-bakery: local-spin k-exclusion using non-atomic reads and writes
Mutual exclusion is used to coordinate access to shared resources by concurrent processes. k-Exclusion is a variant of mutual exclusion in which up to k processes can simultaneous...
Robert Danek