Sciweavers

1528 search results - page 173 / 306
» On Signatures for Communication Graphs
Sort
View
WG
2010
Springer
13 years 8 months ago
Network Exploration by Silent and Oblivious Robots
In this paper we investigate the basic problem of Exploration of a graph by a group of identical mobile computational entities, called robots, operating autonomously and asynchrono...
Jérémie Chalopin, Paola Flocchini, B...
IPPS
2009
IEEE
14 years 4 months ago
Toward adjoinable MPI
4 Automatic diļ¬€erentiation is the primary means of obtaining analytic5 derivatives from a numerical model given as a computer program. There-6 fore, it is an essential productivi...
Jean Utke, Laurent Hascoët, Patrick Heimbach,...
APCSAC
2005
IEEE
14 years 3 months ago
Irregular Redistribution Scheduling by Partitioning Messages
Abstract. Dynamic data redistribution enhances data locality and improves algorithm performance for numerous scientific problems on distributed memory multi-computers systems. Prev...
Chang Yu, Ching-Hsien Hsu, Kun-Ming Yu, Chiu-Kuo L...
ACISP
2007
Springer
14 years 1 months ago
On Proactive Perfectly Secure Message Transmission
This paper studies the interplay of network connectivity and perfectly secure message transmission under the corrupting influence of a Byzantine mobile adversary that may move from...
Kannan Srinathan, Prasad Raghavendra, C. Pandu Ran...
CRYPTO
2006
Springer
159views Cryptology» more  CRYPTO 2006»
14 years 1 months ago
Asymptotically Optimal Two-Round Perfectly Secure Message Transmission
Abstract. The problem of perfectly secure message transmission concerns two synchronized non-faulty processors sender (S) and receiver (R) that are connected by a synchronous netwo...
Saurabh Agarwal, Ronald Cramer, Robbert de Haan