Sciweavers

398 search results - page 12 / 80
» Critical exponents of graphs
Sort
View
CORR
2006
Springer
166views Education» more  CORR 2006»
13 years 9 months ago
Bounding the Bias of Tree-Like Sampling in IP Topologies
Abstract. It is widely believed that the Internet's AS-graph degree distribution obeys a power-law form. However, it was recently argued that since Internet data is collected ...
Reuven Cohen, Mira Gonen, Avishai Wool
ICANN
2009
Springer
14 years 4 months ago
Spectra of the Spike Flow Graphs of Recurrent Neural Networks
Recently the notion of power law networks in the context of neural networks has gathered considerable attention. Some empirical results show that functional correlation networks in...
Filip Piekniewski
SIGMETRICS
2008
ACM
115views Hardware» more  SIGMETRICS 2008»
13 years 9 months ago
Densification arising from sampling fixed graphs
During the past decade, a number of different studies have identified several peculiar properties of networks that arise from a diverse universe, ranging from social to computer n...
Pedram Pedarsani, Daniel R. Figueiredo, Matthias G...
CSCLP
2005
Springer
14 years 3 months ago
A CSP Search Algorithm with Reduced Branching Factor
This paper presents an attempt to construct a ”practical” CSP algorithm that assigns a variable with 2 values at every step. Such a strategy has been successfully used for cons...
Igor Razgon, Amnon Meisels
ALGORITHMICA
2011
13 years 4 months ago
All-Pairs Bottleneck Paths in Vertex Weighted Graphs
Let G = (V, E, w) be a directed graph, where w : V → R is an arbitrary weight function defined on its vertices. The bottleneck weight, or the capacity, of a path is the smalles...
Asaf Shapira, Raphael Yuster, Uri Zwick