Sciweavers

16430 search results - page 2757 / 3286
» On Computable Tree Functions
Sort
View
FCCM
2000
IEEE
122views VLSI» more  FCCM 2000»
15 years 11 months ago
Evaluating Hardware Compilation Techniques
Hardware compilation techniques which use highlevel programming languages to describe and synthesize hardware are gaining popularity. They are especially useful for reconfigurable...
Markus Weinhardt, Wayne Luk
WMCSA
2000
IEEE
15 years 11 months ago
A Composable Framework for Secure Multi-Modal Access to Internet Services from Post-PC Devices
The Post-PC revolution is bringing information access to a wide-range of devices beyond the desktop, such as public kiosks, and mobile devices like cellular telephones, PDAs, and ...
Steven J. Ross, Jason L. Hill, Michael Y. Chen, An...
ICCAD
1999
IEEE
148views Hardware» more  ICCAD 1999»
15 years 11 months ago
SAT based ATPG using fast justification and propagation in the implication graph
In this paper we present new methods for fast justification and propagation in the implication graph (IG) which is the core data structure of our SAT based implication engine. As ...
Paul Tafertshofer, Andreas Ganz
WETICE
1997
IEEE
15 years 11 months ago
Capturing Geometry Rationale for Collaborative Design
When an artifact is designed the typical output consists of documents describing the final result of a long series of deliberations and tradeoffs by the participants of collaborat...
Mark Klein
FC
1997
Springer
86views Cryptology» more  FC 1997»
15 years 11 months ago
The SPEED Cipher
Abstract. SPEED is a private key block cipher. It supports three variable parameters: (1) data length — the length of a plaintext/ciphertext of SPEED can be 64, 128 or 256 bits. ...
Yuliang Zheng
« Prev « First page 2757 / 3286 Last » Next »