420 search results - page 78 / 84 » A Small Test Generator for Large Designs |
INFOCOM
2011
IEEE
12 years 11 months ago
2011
IEEE
Abstract—Regular expression matching (REM) with nondeterministic finite automata (NFA) can be computationally expensive when a large number of patterns are matched concurrently....
ISCA
2011
IEEE
12 years 11 months ago
2011
IEEE
As we move to large manycores, the hardware-based global checkpointing schemes that have been proposed for small shared-memory machines do not scale. Scalability barriers include ...
BIOINFORMATICS
2007
13 years 7 months ago
2007
Motivation: Protein–protein complexes are known to play key roles in many cellular processes. However, they are often not accessible to experimental study because of their low s...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We investigate Monte Carlo Markov Chain (MCMC) procedures for the random sampling of some one-dimensional lattice paths with constraints, for various constraints. We will see that...
CIKM
2009
Springer
14 years 4 days ago
2009
Springer
Exact substring matching queries on large data collections can be answered using q-gram indices, that store for each occurring q-byte pattern an (ordered) posting list with the po...