Sciweavers

2419 search results - page 136 / 484
» Modeling Spatio-temporal Network Computations: A Summary of ...
Sort
View
DAC
1999
ACM
14 years 10 days ago
Circuit Complexity Reduction for Symbolic Analysis of Analog Integrated Circuits
This paper presents a method to reduce the complexity of a linear or linearized (small-signal) analog circuit. The reduction technique, based on quality-error ranking, can be used...
Walter Daems, Georges G. E. Gielen, Willy M. C. Sa...
IPPS
2006
IEEE
14 years 2 months ago
A multiprocessor architecture for the massively parallel model GCA
The GCA (Global Cellular Automata) model consists of a collection of cells which change their states synchronously depending on the states of their neighbors like in the classical...
Wolfgang Heenes, Rolf Hoffmann, Johannes Jendrsczo...
SAC
2010
ACM
14 years 2 months ago
Estimating node similarity from co-citation in a spatial graph model
Co-citation (number of nodes linking to both of a given pair of nodes) is often used heuristically to judge similarity between nodes in a complex network. We investigate the relat...
Jeannette Janssen, Pawel Pralat, Rory Wilson
APIN
1999
107views more  APIN 1999»
13 years 7 months ago
Massively Parallel Probabilistic Reasoning with Boltzmann Machines
We present a method for mapping a given Bayesian network to a Boltzmann machine architecture, in the sense that the the updating process of the resulting Boltzmann machine model pr...
Petri Myllymäki
WCNC
2010
IEEE
13 years 12 months ago
Throughput Analysis for Cooperation in Random Access Networks
—This paper aims at answering the questions of how to enable cooperative communications in random access networks. And, since cooperation introduces extra transmissions in the ch...
Amr El-Sherif, K. J. Ray Liu