8259 search results - page 1559 / 1652 » On Generalized Feistel Networks |
168
click to vote
PODC
2009
ACM
16 years 18 days ago
2009
ACM
We study communication complexity of consensus in synchronous message-passing systems with processes prone to crashes. The goal in the consensus problem is to have all the nonfaul...
181
click to vote
SC
2009
ACM
16 years 18 days ago
2009
ACM
This paper presents a new distributed computing framework for Many Task Computing (MTC) applications, based on the Extensible Messaging and Presence Protocol (XMPP). A lightweight...
159
Voted
SPAA
2009
ACM
16 years 18 days ago
2009
ACM
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...
162
click to vote
WSDM
2009
ACM
16 years 18 days ago
2009
ACM
We are experiencing an unprecedented increase of content contributed by users in forums such as blogs, social networking sites and microblogging services. Such abundance of conten...
150
click to vote
WSDM
2009
ACM
16 years 18 days ago
2009
ACM
A variety of lossless compression schemes have been proposed to reduce the storage requirements of web graphs. One successful approach is virtual node compression [7], in which of...