Sciweavers

267 search results - page 3 / 54
» Accurate Estimation of the Degree Distribution of Private Ne...
Sort
View
COMCOM
2011
12 years 12 months ago
Evaluation of a new method for measuring the internet degree distribution: Simulation results
Many contributions rely on the degree distribution of the Internet topology. However, current knowledge of this property is based on biased and erroneous measurements and is subje...
Christophe Crespelle, Fabien Tarissan
CIKM
2010
Springer
13 years 3 months ago
Fast and accurate estimation of shortest paths in large graphs
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
Andrey Gubichev, Srikanta J. Bedathur, Stephan Seu...
ICC
2007
IEEE
126views Communications» more  ICC 2007»
13 years 11 months ago
Probabilistic Search in P2P Networks with High Node Degree Variation
— A novel Adaptive Resource-based Probabilistic Search algorithm (ARPS) for P2P networks is proposed in this paper. ARPS introduces weighted probabilistic forwarding for query me...
Haoxiang Zhang, Lin Zhang, Xiuming Shan, Victor O....
ISPD
2005
ACM
174views Hardware» more  ISPD 2005»
13 years 10 months ago
Fast and accurate rectilinear steiner minimal tree algorithm for VLSI design
In this paper, we present a very fast and accurate rectilinear Steiner minimal tree (RSMT)1 algorithm called FLUTE. The algorithm is an extension of the wirelength estimation appr...
Chris C. N. Chu, Yiu-Chung Wong
SIGCOMM
2006
ACM
13 years 11 months ago
Systematic topology analysis and generation using degree correlations
Researchers have proposed a variety of metrics to measure important graph properties, for instance, in social, biological, and computer networks. Values for a particular graph met...
Priya Mahadevan, Dmitri V. Krioukov, Kevin R. Fall...