Sciweavers

6251 search results - page 86 / 1251
» Randomness, Computability, and Density
Sort
View
CORR
2007
Springer
136views Education» more  CORR 2007»
13 years 10 months ago
The analytic computability of the Shannon transform for a large class of random matrix channels
We define a class of “algebraic” random matrix channels for which one can generically compute the limiting Shannon transform using numerical techniques and often enumerate th...
N. Raj Rao
MOC
2000
132views more  MOC 2000»
13 years 9 months ago
Lattice computations for random numbers
We improve on a lattice algorithm of Tezuka for the computation of the k-distribution of a class of random number generators based on finite fields. We show how this is applied to ...
Raymond Couture, Pierre L'Ecuyer
ICCAD
2002
IEEE
143views Hardware» more  ICCAD 2002»
14 years 6 months ago
A Markov chain sequence generator for power macromodeling
In macromodeling-based power estimation, circuit macromodels are created from simulations of synthetic input vector sequences. Fast generation of these sequences with all possible...
Xun Liu, Marios C. Papaefthymiou
ICNS
2009
IEEE
14 years 4 months ago
Impact of Obstacles on the Degree of Mobile Ad Hoc Connection Graphs
What is the impact of obstacles on the graphs of connections between stations in Mobile Ad hoc Networks? In order to answer, at least partially, this question, the first step is ...
Cédric Gaël Aboue-Nze, Fréd&eac...
SLIP
2009
ACM
14 years 4 months ago
Closed-form solution for timing analysis of process variations on SWCNT interconnect
In this paper, a comprehensive and fast method is presented for the timing analysis of process variations on single-walled carbon nanotube (SWCNT) bundles. Unlike previous works t...
Peng Sun, Rong Luo