8512 search results - page 1491 / 1703 » Computing Theory With Relevance |
204
click to vote
PODC
2006
ACM
16 years 15 days ago
2006
ACM
We consider the problem of name-independent routing in doubling metrics. A doubling metric is a metric space whose doubling dimension is a constant, where the doubling dimension o...
187
click to vote
PODC
2006
ACM
16 years 15 days ago
2006
ACM
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...
204
click to vote
SACMAT
2006
ACM
16 years 15 days ago
2006
ACM
We introduce the concept, model, and policy-specific algorithms for inferring new access control decisions from previous ones. Our secondary and approximate authorization model (...
181
click to vote
PODC
2005
ACM
16 years 3 days ago
2005
ACM
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...
186
click to vote
DIGRA
2005
Springer
16 years 2 days ago
2005
Springer
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 ...