1756 search results - page 153 / 352 » Directed scale-free graphs |
COCO
2010
Springer
14 years 3 days ago
2010
Springer
Designing algorithms that use logarithmic space for graph reachability problems is fundamental to complexity theory. It is well known that for general directed graphs this problem...
IC
2003
13 years 9 months ago
2003
Abstract— In this paper, we develop methods to “sample” a large real network into a small realistic graph. Although topology modeling has received a lot attention lately, it ...
DAM
2007
13 years 8 months ago
2007
In hardware design, it is necessary to simulate the anticipated behavior of the integrated circuit before it is actually cast in silicon. As simulation procedures are long due to ...
JETAI
1998
13 years 7 months ago
1998
Graphical structures such as Bayesian networks or Markov networks are very useful tools for representing irrelevance or independency relationships, and they may be used to e cientl...
SRDS
2010
IEEE
13 years 6 months ago
2010
IEEE
Abstract--Fault localization in enterprise networks is extremely challenging. A recent approach called Sherlock makes some headway into this problem by using an inference algorithm...