Sciweavers

23988 search results - page 4429 / 4798
» Social Network Computing
Sort
View
PODC
2006
ACM
15 years 11 months 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
15 years 11 months 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
SIGECOM
2006
ACM
119views ECommerce» more  SIGECOM 2006»
15 years 11 months ago
Nash equilibria in graphical games on trees revisited
Graphical games have been proposed as a game-theoretic model of large-scale distributed networks of non-cooperative agents. When the number of players is large, and the underlying...
Edith Elkind, Leslie Ann Goldberg, Paul W. Goldber...
CCGRID
2005
IEEE
15 years 10 months ago
Performance evaluation of JXTA communication layers
— The arrival of the P2P model has opened many new avenues for research within the field of distributed computing. This is mainly due to important practical features (such as su...
Gabriel Antoniu, Philip J. Hatcher, Mathieu Jan, D...
FOCS
2005
IEEE
15 years 10 months ago
Metric Embeddings with Relaxed Guarantees
We consider the problem of embedding finite metrics with slack: we seek to produce embeddings with small dimension and distortion while allowing a (small) constant fraction of al...
Ittai Abraham, Yair Bartal, Hubert T.-H. Chan, Ked...
« Prev « First page 4429 / 4798 Last » Next »