332 search results - page 47 / 67 » Complexity analysis of a decentralised graph colouring algor... |
AINA
2007
IEEE
14 years 2 months ago
2007
IEEE
In hierarchical distributed systems, shared data access can be controlled by assigning user groups single cryptographic keys that allow high level users derive low level keys, but...
AAECC
2006
Springer
13 years 11 months ago
2006
Springer
We study the design of structured Tanner codes with low error-rate floors on the AWGN channel. The design technique involves the "doping" of standard LDPC (proto-)graphs,...
TKDE
2010
13 years 6 months ago
2010
—Authority flow and proximity search have been used extensively in measuring the association between entities in data graphs, ranging from the Web to relational and XML database...
SIGMOD
2012
ACM
11 years 10 months ago
2012
ACM
While extensive work has been done on evaluating queries over tuple-independent probabilistic databases, query evaluation over correlated data has received much less attention eve...
STOC
2010
ACM
14 years 15 days ago
2010
ACM
In this paper we investigate distributed computation in dynamic networks in which the network topology changes from round to round. We consider a worst-case model in which the com...