Sciweavers

3602 search results - page 91 / 721
» Isn't It About Time
Sort
View
GLVLSI
2000
IEEE
87views VLSI» more  GLVLSI 2000»
14 years 1 months ago
Speeding up symbolic model checking by accelerating dynamic variable reordering
Symbolic Model checking is a widely used technique in sequential verification. As the size of the OBDDs and also the computation time depends on the order of the input variables,...
Christoph Meinel, Christian Stangier
FSE
2006
Springer
109views Cryptology» more  FSE 2006»
14 years 20 days ago
Cryptanalysis of the Stream Cipher DECIM
DECIM is a hardware oriented stream cipher with an 80-bit key and a 64-bit IV. In this paper, we point out two serious flaws in DECIM. One flaw is in the initialization of DECIM. I...
Hongjun Wu, Bart Preneel
ASPDAC
2000
ACM
77views Hardware» more  ASPDAC 2000»
14 years 1 months ago
Compact yet high performance (CyHP) library for short time-to-market with new technologies
Two compact yet high performance standard cell libraries (CyHP libraries), which contain only 11111111 and 20 cells respectively, are proposed. The first CyHP library leads to 5% i...
Nguyen Minh Duc, Takayasu Sakurai
DEBS
2008
ACM
13 years 10 months ago
On static determination of temporal relevance for incremental evaluation of complex event queries
Evaluation of complex event queries over time involves storing information about those events that are relevant for, i.e., might contribute to, future answers. We call the period ...
François Bry, Michael Eckert
SODA
1992
ACM
123views Algorithms» more  SODA 1992»
13 years 10 months ago
Computing Minimal Spanning Subgraphs in Linear Time
Let P be a property of undirected graphs. We consider the following problem: given a graph G that has property P, nd a minimal spanning subgraph of G with property P. We describe ...
Xiaofeng Han, Pierre Kelsen, Vijaya Ramachandran, ...