4099 search results - page 372 / 820 » A Framework for Interactive Proof |
169
click to vote
ICASSP
2009
IEEE
16 years 1 months ago
2009
IEEE
For the first time, a proof of the sifting process (SP) and so the empirical mode decomposition (EMD), is given. For doing this, lower and upper envelopes are modeled in a more c...
164
click to vote
ICDAR
2009
IEEE
16 years 1 months ago
2009
IEEE
In this paper, we make an attempt to use Inductive Logic Programming (ILP) to automatically learn non trivial descriptions of symbols, based on a formal description. This work is ...
160
click to vote
FM
2009
Springer
16 years 1 months ago
2009
Springer
e Abstractions for Parameterized Systems JOXAN JAFFAR and ANDREW E. SANTOSA Department of Computer Science, National University of Singapore Singapore 117590 {joxan,andrews}comp.nu...
154
click to vote
MFCS
2009
Springer
16 years 1 months ago
2009
Springer
We define a framework called the prismoid of resources where each vertex refines the λ-calculus by using a different choice to make explicit or implicit (meta-level) the defin...
188
click to vote
TABLEAUX
2009
Springer
16 years 1 months ago
2009
Springer
We develop a general criterion for cut elimination in sequent calculi for propositional modal logics, which rests on absorption of cut, contraction, weakening and inversion by the ...