Sciweavers

9166 search results - page 421 / 1834
» A framework for comparing models of computation
Sort
View
SC
2000
ACM
15 years 11 months ago
A Comparison of Three Programming Models for Adaptive Applications on the Origin2000
Adaptive applications have computational workloads and communication patterns which change unpredictably at runtime, requiring dynamic load balancing to achieve scalable performan...
Hongzhang Shan, Jaswinder Pal Singh, Leonid Oliker...
NAACL
2010
15 years 4 months ago
Why Synchronous Tree Substitution Grammars?
Synchronous tree substitution grammars are a translation model that is used in syntax-based machine translation. They are investigated in a formal setting and compared to a compet...
Andreas Maletti
CONCUR
2003
Springer
16 years 20 hour ago
Composition of Cryptographic Protocols in a Probabilistic Polynomial-Time Process Calculus
We describe a probabilistic polynomial-time process calculus for analyzing cryptographic protocols and use it to derive compositionality properties of protocols in the presence of ...
Paulo Mateus, John C. Mitchell, Andre Scedrov
IPPS
1999
IEEE
15 years 11 months ago
PARADIGM (version 2.0): A New HPF Compilation System
In this paper,a we present sample performance figures for a new linear algebra-based compilation framework implemented in a research HPF compiler called PARADIGM. The metrics cons...
Pramod G. Joisha, Prithviraj Banerjee
INFOCOM
2003
IEEE
16 years 2 days ago
Blocking Probabilities of Optical Burst Switching Networks Based on Reduced Load Fixed Point Approximations
— This paper provides a framework for analysis and performance evaluation of Optical Burst Switching (OBS) networks. In particular, a new reduced load fixed point approximation ...
Zvi Rosberg, Hai Le Vu, Moshe Zukerman, Jolyon Whi...