2007
DOI: 10.1140/epjb/e2007-00189-0
|View full text |Cite
|
Sign up to set email alerts
|

Enhancing synchronizability by weight randomization on regular networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
6
0

Year Published

2008
2008
2020
2020

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 10 publications
(6 citation statements)
references
References 20 publications
0
6
0
Order By: Relevance
“…Therefore, the improved mean-field equation is proposed based on the analysis of the root cause. In addition, the results of the comparison between the simulations and theoretical verification demonstrate that the modified equation is more accordant with simulations than the unimproved one on different kinds of networks [31,32]. The contents of this paper are divided into the following sections.…”
Section: Introductionmentioning
confidence: 88%
“…Therefore, the improved mean-field equation is proposed based on the analysis of the root cause. In addition, the results of the comparison between the simulations and theoretical verification demonstrate that the modified equation is more accordant with simulations than the unimproved one on different kinds of networks [31,32]. The contents of this paper are divided into the following sections.…”
Section: Introductionmentioning
confidence: 88%
“…Although there are different implementations that leverage quantization techniques by transforming the weights into power of two values [10], or more aggressive ternary [11], or even binary values [12,13,14] and multiplications are hence downgraded to pure shifting or adding operations, these schemes suffer from severe accuracy loss at large datasets. High precision MACs are sometimes necessary and how to effectively optimize zero values and zero-valued bits simultaneously remains as a critical problem in DNN accelerator design.…”
Section: A Ineffectual Computationsmentioning
confidence: 99%
“…The small-world model [ 9 ] proposed by Watts and Strogatz captures the features of high clustering and small average path length, which have been widely observed in real-world networks. These small-world features [ 21 , 22 ] have been found to have a significant impact on the dynamics in interconnected networks [ 23 , 24 ]. The small-world model can be constructed from a regular lattice.…”
Section: Introductionmentioning
confidence: 99%