Sciweavers

2294 search results - page 328 / 459
» From Path Graphs to Directed Path Graphs
Sort
View
SPAA
2003
ACM
14 years 2 months ago
Novel architectures for P2P applications: the continuous-discrete approach
We propose a new approach for constructing P2P networks based on a dynamic decomposition of a continuous space into cells corresponding to servers. We demonstrate the power of thi...
Moni Naor, Udi Wieder
CIAC
2000
Springer
210views Algorithms» more  CIAC 2000»
14 years 1 months ago
Computing a Diameter-Constrained Minimum Spanning Tree in Parallel
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to ...
Narsingh Deo, Ayman Abdalla
WIOPT
2010
IEEE
13 years 7 months ago
Hub-betweenness analysis in delay tolerant networks inferred by real traces
—In this paper we study the influence of using hub nodes to relay messages in human-based delay tolerant networks (DTNs), by analyzing empirical traces obtained by human mobilit...
Giuliano Grossi, Federico Pedersini
ISBI
2007
IEEE
14 years 3 months ago
Two-Tensor Fiber Tractography
Estimating white matter fiber pathways from a diffusion tensor MRI dataset has many important applications in medical research. However, the standard approach of performing track...
Ørjan Bergmann, Gordon L. Kindlmann, Sharon...
NETGAMES
2003
ACM
14 years 2 months ago
Priority-based distribution trees for application-level multicast
In this paper, we propose a novel multicast routing algorithm that is based on application-level priorities and network characteristics: The application may specify an individual ...
Jürgen Vogel, Jörg Widmer, Dirk Farin, M...