Sciweavers

16844 search results - page 160 / 3369
» How to Design Programs
Sort
View
AFRICACRYPT
2008
Springer
15 years 8 months ago
How (Not) to Efficiently Dither Blockcipher-Based Hash Functions?
Abstract. In the context of iterated hash functions, "dithering" designates the technique of adding an iteration-dependent input to the compression function in order to d...
Jean-Philippe Aumasson, Raphael C.-W. Phan
WICON
2008
15 years 7 months ago
Security challenges in seamless mobility: how to "handover" the keys?
In this paper, we discuss key management challenges for seamless handovers across heterogeneous wireless networks. We focus on utilizing existing keying material from previous acc...
Katrin Hoeper, Lidong Chen, Antonio Izquierdo, Nad...
VCIP
2003
170views Communications» more  VCIP 2003»
15 years 7 months ago
How good are the visual MPEG-7 features?
The study presented in this paper analyses descriptions extracted with MPEG-7-descriptors from visual content from the statistical point of view. Good descriptors should generate ...
Horst Eidenberger
MM
2010
ACM
161views Multimedia» more  MM 2010»
15 years 6 months ago
Kodak moments and Flickr diamonds: how users shape large-scale media
In today's age of digital multimedia deluge, a clear understanding of the dynamics of online communities is capital. Users have abandoned their role of passive consumers and ...
Radu Andrei Negoescu, Alexander C. Loui, Daniel Ga...
AHSWN
2010
130views more  AHSWN 2010»
15 years 6 months ago
How Good is Opportunistic Routing? - A Reality Check under Rayleigh Fading Channels
Considerations of realistic channel dynamics motivate the design of a new breed of opportunistic schemes, such as opportunistic transmission, scheduling and routing. Compared to t...
Rong Zheng, Chengzhi Li