Sciweavers

2689 search results - page 33 / 538
» ParalleX: A Study of A New Parallel Computation Model
Sort
View
MASCOTS
2008
13 years 10 months ago
Optimal Layered Multicast with Network Coding: Mathematical Model and Empirical Studies
Abstract--Recent advances in network coding research dramatically changed the underlying structure of optimal multicast routing algorithms and made them efficiently computable. Whi...
Ajay Gopinathan, Zongpeng Li
EUROPAR
1999
Springer
14 years 1 months ago
A New Algorithm for Multi-objective Graph Partitioning
Recently, a number of graph partitioning applications have emerged with additional requirements that the traditional graph partitioning model alone cannot e ectively handle. One s...
Kirk Schloegel, George Karypis, Vipin Kumar
CRYPTO
2011
Springer
195views Cryptology» more  CRYPTO 2011»
12 years 8 months ago
Time-Lock Puzzles in the Random Oracle Model
Abstract. A time-lock puzzle is a mechanism for sending messages “to the future”. The sender publishes a puzzle whose solution is the message to be sent, thus hiding it until e...
Mohammad Mahmoody, Tal Moran, Salil P. Vadhan
CONCUR
2006
Springer
13 years 10 months ago
Model Checking Quantified Computation Tree Logic
Propositional temporal logic is not suitable for expressing properties on the evolution of dynamically allocated entities over time. In particular, it is not possible to trace such...
Arend Rensink
IPPS
1999
IEEE
14 years 1 months ago
A Transformational Framework for Skeletal Programs: Overview and Case Study
A structured approach to parallel programming allows to construct applications by composing skeletons, i.e., recurring patterns of task- and data-parallelism. First academic and co...
Sergei Gorlatch, Susanna Pelagatti