1888 search results - page 263 / 378 » Proof theory and computational analysis |
113
click to vote
COMPGEOM
2003
ACM
15 years 7 months ago
2003
ACM
We consider two variants of the well-known “sailor in the fog” puzzle. The first version (the “asteroid surveying” problem) is set in three dimensions and asks for the sh...
MM
2003
ACM
15 years 7 months ago
2003
ACM
In this paper, we propose a novel solution for segmenting an instructional video into hierarchical topical sections. Incorporating the knowledge of education-oriented film theory...
119
click to vote
ITP
2010
15 years 3 months ago
2010
We present a new formalization of the algebraic hierarchy in Coq, exploiting its new type class mechanism to make practical a solution formerly thought infeasible. Our approach add...
138
click to vote
STOC
2007
ACM
16 years 2 months ago
2007
ACM
We present a polynomial time approximation scheme (PTAS) for the minimum feedback arc set problem on tournaments. A simple weighted generalization gives a PTAS for KemenyYoung ran...
106
click to vote
STOC
2003
ACM
16 years 2 months ago
2003
ACM
We consider a fundamental problem in computational learning theory: learning an arbitrary Boolean function which depends on an unknown set of k out of n Boolean variables. We give...