Sciweavers

376 search results - page 35 / 76
» Developing Theories of Types and Computability via Realizabi...
Sort
View
KBSE
1997
IEEE
13 years 11 months ago
Moving Proofs-As-Programs into Practice
Proofs in the Nuprl system, an implementation of a constructive type theory, yield “correct-by-construction” programs. In this paper a new methodology is presented for extract...
James L. Caldwell
TAGT
1994
Springer
154views Graph Theory» more  TAGT 1994»
13 years 11 months ago
Issues in the Practical Use of Graph Rewriting
Graphs are a popular data structure, and graph-manipulation programs are common. Graph manipulations can be cleanly, compactly, and explicitly described using graph-rewriting notat...
Dorothea Blostein, Hoda Fahmy, Ann Grbavec
RML
2002
82views Business» more  RML 2002»
13 years 7 months ago
A Nonmonotonic Rule System using Ontologies
The development of the Semantic Web proceeds in layers. Currently the most advanced layer that has reached maturity is the ontology layer, in the form of the DAML+OIL language whic...
Grigoris Antoniou
CVPR
2004
IEEE
14 years 9 months ago
Estimating Illumination Direction from Textured Images
We study the problem of estimating the illuminant's direction from images of textured surfaces. Given an isotropic, Gaussian random surface with constant albedo, Koenderink an...
Manik Varma, Andrew Zisserman
ICA
2010
Springer
13 years 7 months ago
Probabilistic Latent Tensor Factorization
We develop a probabilistic modeling framework for multiway arrays. Our framework exploits the link between graphical models and tensor factorization models and it can realize any ...
Y. Kenan Yilmaz, A. Taylan Cemgil