2607 search results - page 434 / 522 » Complete Functional Synthesis |
CORR
2008
Springer
13 years 10 months ago
2008
Springer
Pure, or type-free, Linear Logic proof nets are Turing complete once cut-elimination is5 considered as computation. We introduce modal impredicativity as a new form of impredicati...
CSSC
2008
13 years 10 months ago
2008
The decorrelating property of the discrete wavelet transformation (DWT) appears valuable because one can avoid estimating the correlation structure in the original data space by b...
CSSC
2008
13 years 10 months ago
2008
This paper examines a weighted version of the quantile regression estimator defined by Koenker and Bassett (1978), adjusted to the case of nonlinear longitudinal data. Different w...
DM
2008
13 years 10 months ago
2008
The chromatic capacity cap(G) of a graph G is the largest k for which there exists a k-coloring of the edges of G such that, for every coloring of the vertices of G with the same ...
EJC
2008
13 years 10 months ago
2008
It is known that every constraint-satisfaction problem (CSP) reduces, and is in fact polynomially equivalent, to a digraph coloring problem. By carefully analyzing the constructio...