Sciweavers

111 search results - page 18 / 23
» Errors in Computational Complexity Proofs for Protocols
Sort
View
WISEC
2010
ACM
14 years 1 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
CSL
2000
Springer
14 years 28 days ago
Composition and Submachine Concepts for Sequential ASMs
We define three composition and structuring concepts which reflect frequently used refinements of ASMs and integrate standard structuring constructs into the global state based ...
Egon Börger, Joachim Schmid
ICASSP
2011
IEEE
13 years 9 days ago
Robust talking face video verification using joint factor analysis and sparse representation on GMM mean shifted supervectors
It has been previously demonstrated that systems based on block wise local features and Gaussian mixture models (GMM) are suitable for video based talking face verification due t...
Ming Li, Shrikanth Narayanan
SIGCOMM
2012
ACM
11 years 11 months ago
AutoNetkit: simplifying large scale, open-source network experimentation
We present a methodology that brings simplicity to large and comt labs by using abstraction. The networking community has appreciated the value of large scale test labs to explore...
Simon Knight, Askar Jaboldinov, Olaf Maennel, Iain...
INFOCOM
2012
IEEE
11 years 11 months ago
Approximate convex decomposition based localization in wireless sensor networks
—Accurate localization in wireless sensor networks is the foundation for many applications, such as geographic routing and position-aware data processing. An important research d...
Wenping Liu, Dan Wang, Hongbo Jiang, Wenyu Liu, Ch...