Sciweavers

8259 search results - page 1559 / 1652
» On Generalized Feistel Networks
Sort
View
PODC
2009
ACM
14 years 4 months ago
Fast scalable deterministic consensus for crash failures
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...
Bogdan S. Chlebus, Dariusz R. Kowalski, Michal Str...
SC
2009
ACM
14 years 4 months ago
Kestrel: an XMPP-based framework for many task computing applications
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...
Lance Stout, Michael A. Murphy, Sebastien Goasguen
SPAA
2009
ACM
14 years 4 months ago
Weak graph colorings: distributed algorithms and applications
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...
Fabian Kuhn
WSDM
2009
ACM
117views Data Mining» more  WSDM 2009»
14 years 4 months ago
Query by document
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...
Yin Yang, Nilesh Bansal, Wisam Dakka, Panagiotis G...
WSDM
2009
ACM
187views Data Mining» more  WSDM 2009»
14 years 4 months ago
Speeding up algorithms on compressed web graphs
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...
Chinmay Karande, Kumar Chellapilla, Reid Andersen
« Prev « First page 1559 / 1652 Last » Next »