Sciweavers

2869 search results - page 161 / 574
» The Inference Problem: A Survey
Sort
View
66
Voted
EUSFLAT
2007
121views Fuzzy Logic» more  EUSFLAT 2007»
15 years 2 months ago
Domination and Information Boundedness Principle for Aggregation
The information boundedness principle for rule based inference process requires that the knowledge obtained as a result of a rule should not have more information than that contai...
Michal Sabo
62
Voted
IAAI
2001
15 years 2 months ago
Scaling Up Context-Sensitive Text Correction
The main challenge in an effort to build a realistic system with context-sensitive inference capabilities, beyond accuracy, is scalability. This paper studies this problem in the ...
Andrew J. Carlson, Jeffrey Rosen, Dan Roth
ICGI
2010
Springer
14 years 11 months ago
Rademacher Complexity and Grammar Induction Algorithms: What It May (Not) Tell Us
Abstract. This paper revisits a problem of the evaluation of computational grammatical inference (GI) systems and discusses what role complexity measures can play for the assessmen...
Sophia Katrenko, Menno van Zaanen
100
Voted
CVPR
2000
IEEE
16 years 2 months ago
Order Parameters for Minimax Entropy Distributions: When Does High Level Knowledge Help?
Many problems in vision can be formulated as Bayesian inference. It is important to determine the accuracy of these inferences and how they depend on the problem domain. In recent...
Alan L. Yuille, James M. Coughlan, Song Chun Zhu, ...
115
Voted
ENGL
2007
94views more  ENGL 2007»
15 years 21 days ago
Common subproofs in proof pairs
Abstract—In any formal theory, a proof is a sequence of well formed formulas (wff). Here, we consider the digraph whose nodes are proofs and the edges are pairs of proofs such t...
Guillermo Morales-Luna