Sciweavers

2498 search results - page 375 / 500
» Algorithms for the Topological Watershed
Sort
View
CN
2007
154views more  CN 2007»
13 years 8 months ago
Disjoint multipath routing using colored trees
— Multipath routing (MPR) is an effective strategy to achieve robustness, load balancing, congestion reduction, and increased throughput in computer networks. Disjoint multipath ...
Srinivasan Ramasubramanian, Harish Krishnamoorthy,...
IJSNET
2006
170views more  IJSNET 2006»
13 years 8 months ago
Ordinal MDS-based localisation for wireless sensor networks
: There are various applications in wireless sensor networks which require knowing the relative or actual position of the sensor nodes. Over the past few years, there have been dif...
Vijayanth Vivekanandan, Vincent W. S. Wong
CORR
2007
Springer
94views Education» more  CORR 2007»
13 years 8 months ago
Size reduction of complex networks preserving modularity
The ubiquity of modular structure in real-world complex networks is being the focus of attention in many trials to understand the interplay between network topology and functionali...
Alex Arenas, J. Duch, A. Fernandez, Sergio G&oacut...
INFORMATICALT
2006
102views more  INFORMATICALT 2006»
13 years 8 months ago
Parallel DEM Software for Simulation of Granular Media
The paper describes the development and performance of parallel algorithms for the discrete element method (DEM) software. Spatial domain decomposition strategy and message passing...
Algirdas Maknickas, Arnas Kaceniauskas, Rimantas K...
CORR
2007
Springer
47views Education» more  CORR 2007»
13 years 8 months ago
Data Structures for Mergeable Trees
Motivated by an application in computational topology, we consider a novel variant of the problem of efficiently maintaining dynamic rooted trees. This variant allows an operation...
Loukas Georgiadis, Haim Kaplan, Nira Shafrir, Robe...