Sciweavers

35419 search results - page 236 / 7084
» How are we doing
Sort
View
AFRICACRYPT
2008
Springer
15 years 6 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
SODA
2008
ACM
127views Algorithms» more  SODA 2008»
15 years 6 months ago
Nondecreasing paths in a weighted graph or: how to optimally read a train schedule
A travel booking office has timetables giving arrival and departure times for all scheduled trains, including their origins and destinations. A customer presents a starting city a...
Virginia Vassilevska
APVIS
2006
15 years 6 months ago
How people read sociograms: a questionnaire study
Visualizing social network data into sociograms plays an important role in communicating information about network characteristics. Previous studies have shown that human percepti...
Weidong Huang, Seok-Hee Hong, Peter Eades
WOA
2001
15 years 6 months ago
How to Support Adaptive Mobile Applications
The Mobile Agent (MA) paradigm seems to be a promising solution for the design and development of distributed value-added services. However, mobility has added complexity to the d...
Antonio Corradi, Rebecca Montanari, Gianluca Tonti...
AHSWN
2010
130views more  AHSWN 2010»
15 years 4 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