1763 search results - page 91 / 353 » A Formalization of Polytime Functions |
111
click to vote
TKDE
2012
13 years 8 days ago
2012
—The pairwise constraints specifying whether a pair of samples should be grouped together or not have been successfully incorporated into the conventional clustering methods such...
TLCA
2007
Springer
15 years 4 months ago
2007
Springer
We describe a new method to represent (partial) recursive functions in type theory. For every recursive definition, we define a co-inductive type of prophecies that characterises...
NIPS
2008
14 years 11 months ago
2008
We present a sparse approximation approach for dependent output Gaussian processes (GP). Employing a latent function framework, we apply the convolution process formalism to estab...
IFL
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. Type checkers for dependent types need to evaluate user defined functions during type checking. For this, current implementations typically use an interpreter, which has...
FSS
2006
14 years 10 months ago
2006
Abstract. We show a complete axiomatization of unary connectives interpreted by monotone and superdiagonal truth functions, so-called truth-depressing hedges. These connectives for...