Sciweavers

1528 search results - page 291 / 306
» On Signatures for Communication Graphs
Sort
View
INFOCOM
2002
IEEE
14 years 1 months ago
Stability of a Multicast Tree
— Most of the currently deployed multicast protocols (e.g. DVMRP, PIM, MOSPF) build one shortest path multicast tree per sender, the tree being rooted at the sender’s subnetwor...
Piet Van Mieghem, Milena Janic
IPPS
1999
IEEE
14 years 28 days ago
Reducing I/O Complexity by Simulating Coarse Grained Parallel Algorithms
Block-wise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is fully par...
Frank K. H. A. Dehne, David A. Hutchinson, Anil Ma...
AAIM
2006
Springer
129views Algorithms» more  AAIM 2006»
14 years 12 days ago
Secure Overlay Network Design
Due to the increasing security threats on the Internet, new overlay network architectures have been proposed to secure privileged services. In these architectures, the application...
Erran L. Li, Mohammad Mahdian, Vahab S. Mirrokni
CLIMA
2004
13 years 10 months ago
Weighted Multi Dimensional Logic Programs
Abstract. We introduce a logical framework suitable to formalize structures of epistemic agents. Such a framework is based on the notion of weighted directed acyclic graphs (WDAGs)...
Pierangelo Dell'Acqua
APPML
2007
154views more  APPML 2007»
13 years 8 months ago
Comparison of distances between measures
The problem of optimal transportation between a set of sources and a set of wells has become recently the object of new mathematical models generalizing the Monge-Kantorovich prob...
Jean-Michel Morel, Filippo Santambrogio