Sciweavers

8699 search results - page 1568 / 1740
» Elements of the Theory of Computation
Sort
View
PODC
2006
ACM
16 years 14 days ago
On the complexity of distributed graph coloring
Coloring the nodes of a graph with a small number of colors is one of the most fundamental problems in theoretical computer science. In this paper, we study graph coloring in a di...
Fabian Kuhn, Roger Wattenhofer
SACMAT
2006
ACM
16 years 14 days ago
The secondary and approximate authorization model and its application to Bell-LaPadula policies
We introduce the concept, model, and policy-specific algorithms for inferring new access control decisions from previous ones. Our secondary and approximate authorization model (...
Jason Crampton, Wing Leung, Konstantin Beznosov
PODC
2005
ACM
16 years 2 days ago
Maximal independent sets in radio networks
We study the distributed complexity of computing a maximal independent set (MIS) in radio networks with completely unknown topology, asynchronous wake-up, and no collision detecti...
Thomas Moscibroda, Roger Wattenhofer
DIGRA
2005
Springer
16 years 2 days ago
/hide: The aesthetics of group and solo play
In this essay, I examine differences between individual and social play and, in particular, the differences between individual and social play within digital media forms designed ...
David Myers
CHI
2004
ACM
15 years 12 months ago
The untapped world of video games
Due to fierce industry competition and demand for novelty, games are a fertile research setting for studying interface design, input devices, graphics, social communication and de...
Kevin Keeker, Randy J. Pagulayan, Jonathan Sykes, ...
« Prev « First page 1568 / 1740 Last » Next »