Sciweavers

2761 search results - page 263 / 553
» Collaborative model merging
Sort
View
INDOCRYPT
2004
Springer
15 years 9 months ago
A Provably Secure Elliptic Curve Scheme with Fast Encryption
Abstract. We present a new elliptic curve cryptosystem with fast encryption and key generation, which is provably secure in the standard model. The scheme uses arithmetic modulo n2...
David Galindo, Sebastià Martín Molle...
ANSS
2003
IEEE
15 years 9 months ago
Multicast Routing Simulator over MPLS Networks
Multicast and MPLS are two complementary technologies. Merging these two technologies where multicast trees are constructed over MPLS networks will enhance performance and present...
Ali Boudani, Bernard Cousin, Chadi Jawhar, Mahmoud...
ATS
2003
IEEE
87views Hardware» more  ATS 2003»
15 years 9 months ago
March SL: A Test For All Static Linked Memory Faults
The analysis of linked faults has proven to be a source for new memory tests, characterized by an increased fault coverage. The paper gives a set of five new tests to target all ...
Said Hamdioui, Zaid Al-Ars, A. J. van de Goor, Mik...
126
Voted
GROUP
2003
ACM
15 years 9 months ago
Using the transformational approach to build a safe and generic data synchronizer
Reconciliating divergent data is an important issue in concurrent engineering, mobile computing and software configuration management. Currently, a lot of synchronizers or merge ...
Pascal Molli, Gérald Oster, Hala Skaf-Molli...
SMA
2003
ACM
15 years 9 months ago
Geometric constraint solving via C-tree decomposition
This paper has two parts. First, we propose a method which can be used to decompose a geometric constraint graph into a c-tree. With this decomposition, solving for a well-constrai...
Xiao-Shan Gao, Gui-Fang Zhang