1209 search results - page 113 / 242 » Universal Algebra and Computer Science |
119
click to vote
STOC
1991
ACM
15 years 6 months ago
1991
ACM
The study of self-testing/correcting programs was introduced in [8] in order to allow one to use program P to compute function f without trusting that P works correctly. A self-te...
131
click to vote
SODA
2000
ACM
15 years 4 months ago
2000
ACM
We present a model that enables us to analyze the running time of an algorithm on a computer with a memory hierarchy with limited associativity, in terms of various cache parameter...
164
Voted
Source Code
The code is a (good, in my opinion) implementation of a segmentation engine based on normalised cuts (a spectral clustering algorithm) and a pixel affinity matrix calculation algor...
124
click to vote
TLCA
2009
Springer
15 years 9 months ago
2009
Springer
G¨odel’s completeness theorem is concerned with provability, while Girard’s theorem in ludics (as well as full completeness theorems in game semantics) are concerned with proo...
146
click to vote
TLCA
2007
Springer
15 years 9 months ago
2007
Springer
A Kripke Semantics is defined for a higher-order logic programming language with constraints, based on Church’s Theory of Types and a generic constraint formalism. Our syntactic...