Sciweavers

152 search results - page 14 / 31
» Memory-Efficient Inference in Relational Domains
Sort
View
ICCV
1999
IEEE
15 years 2 months ago
Bayesian Structure from Motion
:We formulate structure from motion as a Bayesian inference problem, and use a Markov chain Monte Carlo sampler to sample the posterior on this problem. This results in a method th...
David A. Forsyth, Sergey Ioffe, John A. Haddon
IJON
2008
98views more  IJON 2008»
14 years 9 months ago
Factorisation and denoising of 0-1 data: A variational approach
Presence-absence (0-1) observations are special in that often the absence of evidence is not evidence of absence. Here we develop an independent factor model, which has the unique...
Ata Kabán, Ella Bingham
RIA
2006
84views more  RIA 2006»
14 years 9 months ago
Learning Recursive Automata from Positive Examples
In this theoretical paper, we compare the "classical" learning techniques used to infer regular grammars from positive examples with the ones used to infer categorial gra...
Isabelle Tellier
DKE
2007
132views more  DKE 2007»
14 years 9 months ago
Automated ontology construction for unstructured text documents
Ontology is playing an increasingly important role in knowledge management and the Semantic Web. This study presents a novel episode-based ontology construction mechanism to extra...
Chang-Shing Lee, Yuan-Fang Kao, Yau-Hwang Kuo, Mei...
LFCS
1992
Springer
15 years 1 months ago
Strictness Logic and Polymorphic Invariance
We describe a logic for reasoning about higher-order strictness properties of typed lambda terms. The logic arises from axiomatising the inclusion order on certain closed subsets ...
P. N. Benton