Sciweavers

1847 search results - page 148 / 370
» Hybrid Functional Interpretations
Sort
View
NIPS
1992
15 years 7 months ago
Network Structuring and Training Using Rule-Based Knowledge
We demonstrate in this paper how certain forms of rule-based knowledge can be used to prestructure a neural network of normalized basis functions and give a probabilistic interpre...
Volker Tresp, Jürgen Hollatz, Subutai Ahmad
ICCV
2011
IEEE
14 years 6 months ago
Diffusion Runs Low on Persistence Fast
Interpreting an image as a function on a compact subset of the Euclidean plane, we get its scale-space by diffusion, spreading the image over the entire plane. This generates a 1-...
Chao Chen, Herbert Edelsbrunner
CC
2009
Springer
142views System Software» more  CC 2009»
16 years 6 months ago
Extensible Proof-Producing Compilation
This paper presents a compiler which produces machine code from functions defined in the logic of a theorem prover, and at the same time proves that the generated code executes the...
Magnus O. Myreen, Konrad Slind, Michael J. C. Gord...
TPHOL
2003
IEEE
15 years 11 months ago
Applications of Polytypism in Theorem Proving
Abstract. Polytypic functions have mainly been studied in the context of functional programming languages. In that setting, applications of polytypism include elegant treatments of...
Konrad Slind, Joe Hurd
COCO
2001
Springer
107views Algorithms» more  COCO 2001»
15 years 10 months ago
In Search of an Easy Witness: Exponential Time vs. Probabilistic Polynomial Time
Restricting the search space {0, 1}n to the set of truth tables of “easy” Boolean functions on log n variables, as well as using some known hardness-randomness tradeoffs, we ...
Russell Impagliazzo, Valentine Kabanets, Avi Wigde...