Sciweavers

21520 search results - page 76 / 4304
» Symmetric network computation
Sort
View
ENTCS
2008
126views more  ENTCS 2008»
15 years 5 months ago
Comonadic Notions of Computation
We argue that symmetric (semi)monoidal comonads provide a means to structure context-dependent notions of computation such as notions of dataflow computation (computation on strea...
Tarmo Uustalu, Varmo Vene
IPPS
1999
IEEE
15 years 9 months ago
Portable Parallel Programming for the Dynamic Load Balancing of Unstructured Grid Applications
The ability to dynamically adapt an unstructured grid (or mesh) is a powerful tool for solving computational problems with evolving physical features; however, an efficient parall...
Rupak Biswas, Leonid Oliker, Sajal K. Das, Daniel ...
178
Voted
FOCS
1998
IEEE
15 years 9 months ago
Quantum Lower Bounds by Polynomials
We examine the number T of queries that a quantum network requires to compute several Boolean functions on f0;1gN in the black-box model. We show that, in the blackbox model, the ...
Robert Beals, Harry Buhrman, Richard Cleve, Michel...
ICNS
2009
IEEE
16 years 9 hour ago
Counter-Flooding: DoS Protection for Public Key Handshakes in LANs
—The majority of security protocols employ public key cryptography for authentication at least in the connection setup phase. However, verifying digital signatures is an expensiv...
Yves Igor Jerschow, Björn Scheuermann, Martin...
TAPSOFT
1995
Springer
15 years 9 months ago
On the Category of Petri Net Computations
Abstract. We introduce the notion of strongly concatenable process as a refinement of concatenable processes [3] which can be expressed axiomatically via a functor Q[ ] from the c...
Vladimiro Sassone