Sciweavers

6142 search results - page 466 / 1229
» The Complexity of Partition Functions
Sort
View
FOCS
2008
IEEE
16 years 1 months ago
Lower Bounds for Noisy Wireless Networks using Sampling Algorithms
We show a tight lower bound of Ω(N log log N) on the number of transmissions required to compute several functions (including the parity function and the majority function) in a...
Chinmoy Dutta, Jaikumar Radhakrishnan
FSE
2010
Springer
144views Cryptology» more  FSE 2010»
15 years 11 months ago
Pseudo-cryptanalysis of the Original Blue Midnight Wish
The hash function Blue Midnight Wish (BMW) is a candidate in the SHA-3 competition organised by the U.S. National Institute of Standards and Technology (NIST). BMW was selected fo...
Søren S. Thomsen
ACSAC
1998
IEEE
15 years 11 months ago
Security Services in an Open Service Environment
Emerging telecommunication services use, store, or transmit sensitive personal data to form individual network services. We suggest an add-on approach to realize secure telecommun...
Reiner Sailer
ASWSD
2006
Springer
15 years 10 months ago
Reusable Services and Semi-automatic Service Composition for Automotive Software
Automotive software has become an important factor in the development of modern and innovative high-end vehicles. More and more functions can only be realized by the cooperation of...
Holger Giese
IADIS
2004
15 years 8 months ago
Structuration and metadata for electronic library
The complexity of preserving the web is becoming one of the most important information and communication media. While the quantity of digital resources available through the web i...
Omar Larouk, Salah Dalhoumi