Sciweavers

7978 search results - page 656 / 1596
» Combining shared-coin algorithms
Sort
View
ER
2003
Springer
119views Database» more  ER 2003»
16 years 14 days ago
Toward the Automatic Derivation of XML Transformations
Existing solutions to data and schema integration require user interaction/input to generate a data transformation between two different schemas. These approaches are not appropri...
Martin Erwig
IMR
2003
Springer
16 years 13 days ago
Multiple Stationary and Moving Boundary Handling in Cartesian Grids
A Cartesian grid generation methodology is developed for unsteady control volume computational fluid dynamic (CFD) solvers. Arbitrary combinations and numbers of moving and statio...
Kerem Pekkan
ICC
2000
IEEE
102views Communications» more  ICC 2000»
15 years 11 months ago
Multiple Access Techniques for Wideband Upstream Powerline Communications: CAP-CDMA and DMT-FDMA
This paper compares two multiuser transmission techniques in the context of wideband upstream powerline communications. The first one is based on the combination of CAP and CDMA,...
Thierry Sartenaer, François Horlin, Luc Van...
KBSE
2000
IEEE
15 years 11 months ago
Circular Coinductive Rewriting
Circular coinductive rewriting is a new method for proving behavioral properties, that combines behavioral rewriting with circular coinduction. This method is implemented in our n...
Joseph A. Goguen, Kai Lin, Grigore Rosu
CSFW
1999
IEEE
15 years 11 months ago
I/O Automaton Models and Proofs for Shared-Key Communication Systems
The combination of two security protocols, a simple shared-key communication protocol and the Di e-Hellman key distribution protocol, is modeled formally and proved correct. The m...
Nancy A. Lynch