Sciweavers

2695 search results - page 468 / 539
» The Complexity of Forecast Testing
Sort
View
INFOCOM
2011
IEEE
14 years 1 months ago
Space-time tradeoff in regular expression matching with semi-deterministic finite automata
Abstract—Regular expression matching (REM) with nondeterministic finite automata (NFA) can be computationally expensive when a large number of patterns are matched concurrently....
Yi-Hua E. Yang, Viktor K. Prasanna
JCC
2011
154views more  JCC 2011»
14 years 20 days ago
Can we trust docking results? Evaluation of seven commonly used programs on PDBbind database
: Docking is one of the most commonly used techniques in drug design. It is used for both identifying correct poses of a ligand in the binding site of a protein as well as for the ...
Dariusz Plewczynski, Michal Lazniewski, Rafal Augu...
SIGMOD
2011
ACM
249views Database» more  SIGMOD 2011»
14 years 17 days ago
FlexMin: a flexible tool for automatic bug isolation in DBMS software
Debugging a database engine is an arduous task due to the complexity of the query workloads and systems. The first step in isolating a bug involves identifying a sequence of step...
Kristi Morton, Nicolas Bruno
DAC
2011
ACM
13 years 9 months ago
Extracting behavior and dynamically generated hierarchy from SystemC models
SystemC is a popular modeling language which can be used to specify systems at bstraction level. Currently, SystemC tools can not cope with SystemC models for which the module hie...
Harry Broeders, René van Leuken
IACR
2011
128views more  IACR 2011»
13 years 9 months ago
Sign Modules in Secure Arithmetic Circuits
In this paper, we study the complexity of secure multiparty computation using only the secure arithmetic black-box of a finite field, counting the cost by the number of secure m...
Ching-Hua Yu