Sciweavers

1448 search results - page 155 / 290
» From Requirements to Code Revisited
Sort
View
CVPR
1999
IEEE
15 years 8 months ago
Projective Rectification Without Epipolar Geometry
We present a novel algorithm performing projective rectification which does not require explicit computation of the epipolar geometry, and specifically of the fundamental matrix. ...
Francesco Isgrò, Emanuele Trucco
FTDCS
1999
IEEE
15 years 8 months ago
Coordinating Open Distributed Systems
Open Distributed Systems are the dominating intellectual issue of the end of this century. Figuring out how to build those systems will become a central issue in distributed system...
Juan Carlos Cruz, Stéphane Ducasse
POPL
1998
ACM
15 years 8 months ago
Maximal Static Expansion
Memory expansions are classical means to extract parallelism from imperative programs. However, for dynamic control programs with general memory accesses, such transformations eit...
Denis Barthou, Albert Cohen, Jean-Francois Collard
POS
1998
Springer
15 years 8 months ago
Porting a Distributed System to PJama: Orthogonal Persistence for Java?
This paper describes the experience of porting a 25,000 line distributed Java [GJS97] program to version 0.3.5.1 of the orthogonally persistent programming environment PJama. The ...
Huw Evans, Susan Spence
WDAG
1998
Springer
107views Algorithms» more  WDAG 1998»
15 years 8 months ago
Transient Fault Detectors
We present fault detectors for transient faults, (i.e. corruptions of the memory of the processors, but not of the code of the processors). We distinguish fault detectors for tasks...
Joffroy Beauquier, Sylvie Delaët, Shlomi Dole...