Sciweavers

5762 search results - page 649 / 1153
» R-tree: A Hardware Implementation
Sort
View
FTCS
1998
89views more  FTCS 1998»
15 years 8 months ago
The Timed Asynchronous Distributed System Model
Abstract-- We propose a formal definition for the timed asynchronous distributed system model. We present extensive measurements of actual message and process scheduling delays and...
Flaviu Cristian, Christof Fetzer
WCE
2007
15 years 8 months ago
MR Image Reconstruction from Pseudo-Hex Lattice Sampling Patterns Using Separable FFT
Abstract— Common MRI sampling patterns in kspace, such as spiral trajectories, have nonuniform density and do not lie on a rectangular grid. We propose mapping the sampled data t...
Jae-Ho Kim, Fred L. Fontaine
ENTCS
2008
139views more  ENTCS 2008»
15 years 7 months ago
Pervasive Compiler Verification - From Verified Programs to Verified Systems
We report in this paper on the formal verification of a simple compiler for the C-like programming language C0. The compiler correctness proof meets the special requirements of pe...
Dirk Leinenbach, Elena Petrova
JSA
2007
89views more  JSA 2007»
15 years 7 months ago
Robust codes and robust, fault-tolerant architectures of the Advanced Encryption Standard
— Hardware implementations of cryptographic algorithms are vulnerable to fault analysis attacks. Methods based on traditional fault-tolerant architectures are not suited for prot...
Konrad J. Kulikowski, Mark G. Karpovsky, Alexander...
ALIFE
2004
15 years 7 months ago
The Data-and-Signals Cellular Automaton and Its Application to Growing Structures
In a traditional cellular automaton (CA) a cell is implemented by a rule table defining its state at the next time step, given its present state and those of its neighbors. The cel...
André Stauffer, Moshe Sipper