Sciweavers

2771 search results - page 8 / 555
» A General Computational Treatment of the Comparative
Sort
View
CIE
2008
Springer
14 years 11 months ago
Interpreting Localized Computational Effects Using Operators of Higher Type
d abstract) John Longley Laboratory for Foundations of Computer Science School of Informatics, University of Edinburgh The King's Buildings, Mayfield Road Edinburgh EH9 3JZ, U...
John Longley
CSFW
2005
IEEE
15 years 3 months ago
Computational and Information-Theoretic Soundness and Completeness of Formal Encryption
We consider expansions of the Abadi-Rogaway logic of indistinguishability of formal cryptographic expressions. We expand the logic in order to cover cases when partial information...
Pedro Adão, Gergei Bana, Andre Scedrov
TCS
2010
14 years 8 months ago
Comparing free algebras in Topological and Classical Domain Theory
We compare how computational effects are modelled in Classical Domain Theory and Topological Domain Theory. Both of these theories provide powerful toolkits for denotational sema...
Ingo Battenfeld
SIGSOFT
2007
ACM
15 years 10 months ago
A framework for characterization and analysis of software system scalability
The term scalability appears frequently in computing literature, but it is a term that is poorly defined and poorly understood. The lack of a clear, consistent and systematic trea...
Leticia Duboc, David S. Rosenblum, Tony Wicks
VTC
2008
IEEE
125views Communications» more  VTC 2008»
15 years 4 months ago
A General Formula for Log-MGF Computation: Application to the Approximation of Log-Normal Power Sum via Pearson Type IV Distribu
Abstract— In [1], we have recently proposed a general approach for approximating the power sum of Log–Normal Random Variables (RVs) by using the Pearson system of distributions...
Marco Di Renzo, Fabio Graziosi, Fortunato Santucci