2950 search results - page 502 / 590 » Computing with Infinitely Many Processes |
SPAA
2009
ACM
14 years 9 months ago
2009
ACM
Dining philosophers is a classic scheduling problem for local mutual exclusion on arbitrary conflict graphs. We establish necessary conditions to solve wait-free dining under even...
CHI
2007
ACM
14 years 9 months ago
2007
ACM
We describe the design process and initial user study of an audio game created for the visually impaired. Until the advent of 3D graphics games, platform games where the player ju...
CHI
2006
ACM
14 years 9 months ago
2006
ACM
Many users are familiar with the interesting but limited functionality of Data Detector interfaces like Microsoft's Smart Tags and Google's AutoLink. In this paper we si...
SIGMOD
2008
ACM
14 years 9 months ago
2008
ACM
Computing statistical information on probabilistic data has attracted a lot of attention recently, as the data generated from a wide range of data sources are inherently fuzzy or ...
PPOPP
2010
ACM
14 years 6 months ago
2010
ACM
Many large-scale parallel programs follow a bulk synchronous parallel (BSP) structure with distinct computation and communication phases. Although the communication phase in such ...