Sciweavers

9687 search results - page 1860 / 1938
» On Natural Mobility Models
Sort
View
WWW
2002
ACM
14 years 11 months ago
Clustering for opportunistic communication
We describe ongoing work on I2I, a system aimed at fostering opportunistic communication among users viewing or manipulating content on the Web and in productivity applications. U...
Jay Budzik, Shannon Bradshaw, Xiaobin Fu, Kristian...
ICFP
2009
ACM
14 years 11 months ago
Causal commutative arrows and their optimization
re a popular form of abstract computation. Being more general than monads, they are more broadly applicable, and in parare a good abstraction for signal processing and dataflow co...
Hai Liu, Eric Cheng, Paul Hudak
POPL
2009
ACM
14 years 11 months ago
A cost semantics for self-adjusting computation
Self-adjusting computation is an evaluation model in which programs can respond efficiently to small changes to their input data by using a change-propagation mechanism that updat...
Ruy Ley-Wild, Umut A. Acar, Matthew Fluet
POPL
2009
ACM
14 years 11 months ago
The theory of deadlock avoidance via discrete control
Deadlock in multithreaded programs is an increasingly important problem as ubiquitous multicore architectures force parallelization upon an ever wider range of software. This pape...
Manjunath Kudlur, Scott A. Mahlke, Stéphane...
EUROCRYPT
2009
Springer
14 years 10 months ago
Resettably Secure Computation
Abstract. The notion of resettable zero-knowledge (rZK) was introduced by Canetti, Goldreich, Goldwasser and Micali (FOCS'01) as a strengthening of the classical notion of zer...
Vipul Goyal, Amit Sahai
« Prev « First page 1860 / 1938 Last » Next »