Sciweavers

3384 search results - page 299 / 677
» More Testable Properties
Sort
View
IEEESCC
2007
IEEE
16 years 1 months ago
A Service Discovery Framework based on Linear Composition
Service discovery has been recognised as an important aspect of service oriented computing. This is even more the case when developing service centric systems in which software sy...
Andrea Zisman, Khaled Mahbub, George Spanoudakis
IJCNN
2007
IEEE
16 years 1 months ago
Theta Neuron Networks: Robustness to Noise in Embedded Applications
- In this paper, we train a one-layer Theta Neuron Network (TNN) to perform a Braitenberg obstacle avoidance algorithm on a Khepera robot. The Theta neuron model is more biological...
Sam McKennoch, Preethi Sundaradevan, Linda G. Bush...
SSDBM
2007
IEEE
105views Database» more  SSDBM 2007»
16 years 29 days ago
Maintaining K-Anonymity against Incremental Updates
K-anonymity is a simple yet practical mechanism to protect privacy against attacks of re-identifying individuals by joining multiple public data sources. All existing methods achi...
Jian Pei, Jian Xu, Zhibin Wang, Wei Wang 0009, Ke ...
183
Voted
WIMOB
2007
IEEE
16 years 28 days ago
A Gossip Protocol to Support Service Discovery with Heterogeneous Ontologies in MANETs
Service discovery in mobile ad hoc networks (MANETs) is an integral part for collective application interoperability. The discovery process must cope not only with transient commun...
Andronikos Nedos, Kulpreet Singh, Raymond Cunningh...
ACISP
2007
Springer
16 years 26 days ago
Hash-and-Sign with Weak Hashing Made Secure
Abstract. Digital signatures are often proven to be secure in the random oracle model while hash functions deviate more and more from this idealization. Liskov proposed to model a ...
Sylvain Pasini, Serge Vaudenay