Sciweavers

1618 search results - page 167 / 324
» Testing random number generators
Sort
View
SENSYS
2003
ACM
14 years 3 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
TIT
2002
63views more  TIT 2002»
13 years 10 months ago
Structured unitary space-time autocoding constellations
We recently showed that arbitrarily reliable communication is possible within a single coherence interval in Rayleigh flat fading as the symbol-duration of the coherence interval ...
Thomas L. Marzetta, Babak Hassibi, Bertrand M. Hoc...
BMCBI
2008
141views more  BMCBI 2008»
13 years 10 months ago
The development of PIPA: an integrated and automated pipeline for genome-wide protein function annotation
Background: Automated protein function prediction methods are needed to keep pace with high-throughput sequencing. With the existence of many programs and databases for inferring ...
Chenggang Yu, Nela Zavaljevski, Valmik Desai, Seth...
ATS
1997
IEEE
87views Hardware» more  ATS 1997»
14 years 2 months ago
A Genetic Algorithm for the Computation of Initialization Sequences for Synchronous Sequential Circuits
Testing circuits which do not include a global reset signal requires either complex ATPG algorithms based on 9- or even 256-valued algebras, or some suitable method to generate in...
Fulvio Corno, Paolo Prinetto, Maurizio Rebaudengo,...
DAM
2008
145views more  DAM 2008»
13 years 10 months ago
Graph coloring in the estimation of sparse derivative matrices: Instances and applications
We describe a graph coloring problem associated with the determination of mathematical derivatives. The coloring instances are obtained as intersection graphs of row partitioned s...
Shahadat Hossain, Trond Steihaug