Sciweavers

523 search results - page 95 / 105
» On the Power of Quantum Proofs
Sort
View
APAL
2010
97views more  APAL 2010»
14 years 12 months ago
A modal logic framework for reasoning about comparative distances and topology
We propose and investigate a uniform modal logic framework for reasoning about topology and relative distance in metric and more general distance spaces, thus enabling the compari...
Mikhail Sheremet, Frank Wolter, Michael Zakharyasc...
APAL
2010
85views more  APAL 2010»
14 years 12 months ago
Elementary differences between the degrees of unsolvability and degrees of compressibility
Given two infinite binary sequences A, B we say that B can compress at least as well as A if the prefix-free Kolmogorov complexity relative to B of any binary string is at most as ...
George Barmpalias
JACM
2007
84views more  JACM 2007»
14 years 11 months ago
Polymorphic higher-order recursive path orderings
This paper extends the termination proof techniques based on reduction orderings to a higher-order setting, by defining a family of recursive path orderings for terms of a typed ...
Jean-Pierre Jouannaud, Albert Rubio
MA
2010
Springer
135views Communications» more  MA 2010»
14 years 10 months ago
Nonparametric comparison of regression functions
In this work we provide a new methodology for comparing regression functions m1 and m2 from two samples. Since apart from smoothness no other (parametric) assumptions are required...
Ramidha Srihera, Winfried Stute
205
Voted
POPL
2009
ACM
16 years 12 days ago
Verifying distributed systems: the operational approach
This work develops an integrated approach to the verification of behaviourally rich programs, founded directly on operational semantics. The power of the approach is demonstrated ...
Tom Ridge