Sciweavers

2517 search results - page 157 / 504
» Specifying Weak Sets
Sort
View
ASAP
2000
IEEE
141views Hardware» more  ASAP 2000»
15 years 11 months ago
Bit Permutation Instructions for Accelerating Software Cryptography
Permutation is widely used in cryptographic algorithms. However, it is not well-supported in existing instruction sets. In this paper, two instructions, PPERM3R and GRP, are propo...
Zhijie Shi, Ruby B. Lee
DAC
1996
ACM
15 years 10 months ago
POSE: Power Optimization and Synthesis Environment
Recent trends in the semiconductor industry have resulted in an increasing demand for low power circuits. POSE is a step in providing the EDA community and academia with an enviro...
Sasan Iman, Massoud Pedram
ACSD
2007
IEEE
140views Hardware» more  ACSD 2007»
15 years 10 months ago
Synthesis of Petri Nets from Finite Partial Languages
In this paper we present two algorithms that effectively synthesize a finite place/transition Petri net (p/t-net) from a finite set of labeled partial orders (a finite partial lang...
Robert Lorenz, Robin Bergenthum, Jörg Desel, ...
COCOON
2009
Springer
15 years 10 months ago
Optimal Transitions for Targeted Protein Quantification: Best Conditioned Submatrix Selection
Multiple reaction monitoring (MRM) is a mass spectrometric method to quantify a specified set of proteins. In this paper, we identify a problem at the core of MRM peptide quantific...
Rastislav Srámek, Bernd Fischer, Elias Vica...
ASPDAC
2004
ACM
144views Hardware» more  ASPDAC 2004»
15 years 10 months ago
Verification of timed circuits with symbolic delays
When time is incorporated in the specification of discrete systems, the complexity of verification grows exponentially. When the temporal behavior is specified with symbols, the ve...
Robert Clarisó, Jordi Cortadella