Sciweavers

3247 search results - page 113 / 650
» Randomized smoothing networks
Sort
View
CAAN
2004
Springer
15 years 9 months ago
Limits and Power Laws of Models for the Web Graph and Other Networked Information Spaces
We consider a generalized copy model of the web graph and related networks, and analyze its limiting behaviour. The model is motivated by previously proposed copying models of the ...
Anthony Bonato, Jeannette C. M. Janssen
118
Voted
AHS
2006
IEEE
125views Hardware» more  AHS 2006»
15 years 10 months ago
Evolving Hardware with Self-reconfigurable connectivity in Xilinx FPGAs
Randomly connecting networks have proven to be universal computing machines. By interconnecting a set of nodes in a random way one can model very complicated non-linear dynamic sy...
Andres Upegui, Eduardo Sanchez
127
Voted
DATE
2006
IEEE
127views Hardware» more  DATE 2006»
15 years 10 months ago
A signal theory based approach to the statistical analysis of combinatorial nanoelectronic circuits
In this paper we present a method which allows the statistical analysis of nanoelectronic Boolean networks with respect to timing uncertainty and noise. All signals are considered...
Oliver Soffke, Peter Zipf, Tudor Murgan, Manfred G...
COMCOM
2002
74views more  COMCOM 2002»
15 years 3 months ago
TRAP: a high performance protocol for wireless local area networks
The
Petros Nicopolitidis, Georgios I. Papadimitriou, M...
WCNC
2010
IEEE
15 years 7 months ago
Node Connectivity Analysis in Multi-Hop Wireless Networks
—In this paper, we study node connectivity in multi-hop wireless networks. Nodal degree of connectivity as one of the fundamental graph properties is the basis for the study of n...
Bahador Bakhshi, Siavash Khorsandi