Sciweavers

933 search results - page 152 / 187
» Centrality Estimation in Large Networks
Sort
View
DCOSS
2006
Springer
15 years 1 months ago
Efficient In-Network Processing Through Local Ad-Hoc Information Coalescence
We consider in-network processing via local message passing. The considered setting involves a set of sensors each of which can communicate with a subset of other sensors. There is...
Onur Savas, Murat Alanyali, Venkatesh Saligrama
HPDC
1999
IEEE
15 years 2 months ago
The Cactus Computational Toolkit and using Distributed Computing to Collide Neutron Stars
We are developing a system for collaborative research and development for a distributed group of researchers at different institutions around the world. In a new paradigm for coll...
Gabrielle Allen, Tom Goodale, Joan Massó, E...
CN
2008
100views more  CN 2008»
14 years 9 months ago
Building resilient low-diameter peer-to-peer topologies
As more applications rely on underlying peer-to-peer topologies, the need for efficient and resilient infrastructure has become more pressing. A number of important classes of top...
Rita H. Wouhaybi, Andrew T. Campbell
CORR
2010
Springer
143views Education» more  CORR 2010»
14 years 9 months ago
Efficient and exact sampling of simple graphs with given arbitrary degree sequence
Uniform sampling from graphical realizations of a given degree sequence is a fundamental component in simulation-based measurements of network observables, with applications rangi...
Charo I. Del Genio, Hyunju Kim, Zoltán Toro...
ICDCS
2008
IEEE
15 years 4 months ago
Measurement Manipulation and Space Selection in Network Coordinates
Internet coordinate systems have emerged as an efficient method to estimate the latency between pairs of nodes without any communication between them. However, most coordinate sy...
Cristian Lumezanu, Neil Spring