Sciweavers

1923 search results - page 244 / 385
» Modeling Complexity in Secure Distributed Computing
Sort
View
WISEC
2010
ACM
15 years 2 months ago
Secret keys from entangled sensor motes: implementation and analysis
Key management in wireless sensor networks does not only face typical, but also several new challenges. The scale, resource limitations, and new threats such as node capture and c...
Matthias Wilhelm, Ivan Martinovic, Jens B. Schmitt
ATAL
2008
Springer
14 years 12 months ago
A statistical relational model for trust learning
We address the learning of trust based on past observations and context information. We argue that from the truster's point of view trust is best expressed as one of several ...
Achim Rettinger, Matthias Nickles, Volker Tresp
ICASSP
2011
IEEE
14 years 1 months ago
Variational methods for spectral unmixing of hyperspectral images
This paper studies a variational Bayesian unmixing algorithm for hyperspectral images based on the standard linear mixing model. Each pixel of the image is modeled as a linear com...
Olivier Eches, Nicolas Dobigeon, Jean-Yves Tourner...
ISORC
2002
IEEE
15 years 2 months ago
Reactive Objects
Object-oriented, concurrent, and event-based programming models provide a natural framework in which to express the behavior of distributed and embedded software systems. However,...
Johan Nordlander, Mark P. Jones, Magnus Carlsson, ...
PKC
2009
Springer
116views Cryptology» more  PKC 2009»
15 years 10 months ago
Improving the Boneh-Franklin Traitor Tracing Scheme
Abstract. Traitor tracing schemes are cryptographically secure broadcast methods that allow identification of conspirators: if a pirate key is generated by k traitors out of a stat...
Pascal Junod, Alexandre Karlov, Arjen K. Lenstra