Sciweavers

2473 search results - page 468 / 495
» The Logic of Communication Graphs
Sort
View
IPPS
1999
IEEE
13 years 12 months 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»
13 years 11 months 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
APPML
2007
154views more  APPML 2007»
13 years 7 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
JUCS
2006
117views more  JUCS 2006»
13 years 7 months ago
Resource Efficient Maintenance of Wireless Network Topologies
Abstract: Multiple hop routing in mobile ad hoc networks can minimize energy consumption and increase data throughput. Yet, the problem of radio interferences remain. However if th...
Tamás Lukovszki, Christian Schindelhauer, K...
TMC
2008
127views more  TMC 2008»
13 years 7 months ago
Time and Energy Complexity of Distributed Computation of a Class of Functions in Wireless Sensor Networks
We consider a scenario in which a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing a...
Nilesh Khude, Anurag Kumar, Aditya Karnik