3690 search results - page 288 / 738 » Computation with classical sequents |
142
click to vote
TLCA
2009
Springer
15 years 12 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...
131
click to vote
CLUSTER
2008
IEEE
15 years 12 months ago
2008
IEEE
—Several performance analysis tools support hybrid applications. Most originated as MPI profiling or tracing tools and OpenMP capabilities were added to extend the performance a...
126
click to vote
FOCS
2008
IEEE
15 years 12 months ago
2008
IEEE
We use a Bayesian approach to optimally solve problems in noisy binary search. We deal with two variants: • Each comparison is erroneous with independent probability 1 − p. ...
122
click to vote
ICPR
2008
IEEE
15 years 11 months ago
2008
IEEE
In this paper, a novel statistical indoor activity recognition algorithm is introduced. While conditional random fields (CRFs) have prominent properties to this task, no optimal ...
147
click to vote
ICPR
2008
IEEE
15 years 11 months ago
2008
IEEE
On-line boosting is a recent advancement in the field of machine learning that has opened a new spectrum of possibilities in many diverse fields. With respect to a static strong...