Sciweavers

492 search results - page 10 / 99
» The number of possibilities for random dating
Sort
View
DELTA
2008
IEEE
14 years 1 months ago
High Performance FPGA Implementation of the Mersenne Twister
Efficient generation of random and pseudorandom sequences is of great importance to a number of applications [4]. In this paper, an efficient implementation of the Mersenne Twis...
Shrutisagar Chandrasekaran, Abbes Amira
EMSOFT
2005
Springer
14 years 1 months ago
Random testing of interrupt-driven software
Interrupt-driven embedded software is hard to thoroughly test since it usually contains a very large number of executable paths. Developers can test more of these paths using rand...
John Regehr
FOCI
2007
IEEE
14 years 1 months ago
Random Hypergraph Models of Learning and Memory in Biomolecular Networks: Shorter-Term Adaptability vs. Longer-Term Persistency
Recent progress in genomics and proteomics makes it possible to understand the biological networks at the systems level. We aim to develop computational models of learning and memo...
Byoung-Tak Zhang
SDM
2007
SIAM
133views Data Mining» more  SDM 2007»
13 years 9 months ago
On Point Sampling Versus Space Sampling for Dimensionality Reduction
In recent years, random projection has been used as a valuable tool for performing dimensionality reduction of high dimensional data. Starting with the seminal work of Johnson and...
Charu C. Aggarwal
DATE
2010
IEEE
124views Hardware» more  DATE 2010»
14 years 17 days ago
Control network generator for latency insensitive designs
—Creating latency insensitive or asynchronous designs from clocked designs has potential benefits of increased modularity and robustness to variations. Several transformations h...
Eliyah Kilada, Kenneth S. Stevens