Sciweavers

121 search results - page 13 / 25
» Distributed Construction of Random Expander Networks
Sort
View
CRYPTO
2001
Springer
152views Cryptology» more  CRYPTO 2001»
15 years 2 months ago
Secure Distributed Linear Algebra in a Constant Number of Rounds
Consider a network of processors among which elements in a finite field K can be verifiably shared in a constant number of rounds. Assume furthermore constant-round protocols ar...
Ronald Cramer, Ivan Damgård
CDC
2009
IEEE
104views Control Systems» more  CDC 2009»
15 years 2 months ago
Moment-based analysis of synchronization in small-world networks of oscillators
— In this paper, we investigate synchronization in a small-world network of coupled nonlinear oscillators. This network is constructed by introducing random shortcuts in a neares...
Victor M. Preciado, Ali Jadbabaie
SENSYS
2003
ACM
15 years 2 months ago
On the scaling laws of dense wireless sensor networks
We consider dense wireless sensor networks deployed to observe arbitrary random fields. The requirement is to reconstruct an estimate of the random field at a certain collector ...
Praveen Kumar Gopala, Hesham El Gamal
PDCAT
2005
Springer
15 years 3 months ago
Optimal Routing in a Small-World Network
Recently a bulk of research [14, 5, 15, 9] has been done on the modelling of the smallworld phenomenon, which has been shown to be pervasive in social and nature networks, and eng...
Jianyang Zeng, Wen-Jing Hsu
IJON
2007
184views more  IJON 2007»
14 years 9 months ago
Convex incremental extreme learning machine
Unlike the conventional neural network theories and implementations, Huang et al. [Universal approximation using incremental constructive feedforward networks with random hidden n...
Guang-Bin Huang, Lei Chen