Sciweavers

1382 search results - page 260 / 277
» Formal Analysis of Online Algorithms
Sort
View
ICFP
2005
ACM
15 years 11 months ago
PolyAML: a polymorphic aspect-oriented functional programming language
This paper defines PolyAML, a typed functional, aspect-oriented programming language. The main contribution of PolyAML is the seamless integration of polymorphism, run-time type a...
Daniel S. Dantas, David Walker, Geoffrey Washburn,...
PODS
2008
ACM
174views Database» more  PODS 2008»
15 years 11 months ago
Epistemic privacy
We present a novel definition of privacy in the framework of offline (retroactive) database query auditing. Given information about the database, a description of sensitive data, ...
Alexandre V. Evfimievski, Ronald Fagin, David P. W...
ALT
2003
Springer
15 years 8 months ago
On the Existence and Convergence of Computable Universal Priors
Solomonoff unified Occam’s razor and Epicurus’ principle of multiple explanations to one elegant, formal, universal theory of inductive inference, which initiated the field...
Marcus Hutter
WMPI
2004
ACM
15 years 5 months ago
The Opie compiler from row-major source to Morton-ordered matrices
The Opie Project aims to develop a compiler to transform C codes written for row-major matrix representation into equivalent codes for Morton-order matrix representation, and to a...
Steven T. Gabriel, David S. Wise
TACAS
2004
Springer
108views Algorithms» more  TACAS 2004»
15 years 5 months ago
Model Checking Discounted Temporal Properties
Temporal logic is two-valued: formulas are interpreted as either true or false. When applied to the analysis of stochastic systems, or systems with imprecise formal models, tempor...
Luca de Alfaro, Marco Faella, Thomas A. Henzinger,...