Sciweavers

534 search results - page 66 / 107
» Approximation of Indistinct Concepts
Sort
View
IJCAI
2001
13 years 9 months ago
Computing Strongest Necessary and Weakest Sufficient Conditions of First-Order Formulas
A technique is proposed for computing the weakest sufficient (wsc) and strongest necessary (snc) conditions for formulas in an expressive fragment of first-order logic using quant...
Patrick Doherty, Witold Lukaszewicz, Andrzej Szala...
IWFM
1998
13 years 9 months ago
Motivation for a New Semantics for Vagueness
Vagueness is the phenomenon that natural language predicates have borderline regions of applicability and that the boundaries of the borderline region are not determinable. A theo...
Mark Changizi
VMV
2000
119views Visualization» more  VMV 2000»
13 years 9 months ago
Orientation Estimation Based on Weighted Projection onto Quadratic Polynomials
Essentially all Computer Vision strategies require initial computation of orientation structure or motion estimation. Although much work has been invested in this subfield, method...
Gunnar Farnebäck
ECAI
2010
Springer
13 years 8 months ago
Context-Specific Independence in Directed Relational Probabilistic Models and its Influence on the Efficiency of Gibbs Sampling
Abstract. There is currently a large interest in relational probabilistic models. While the concept of context-specific independence (CSI) has been well-studied for models such as ...
Daan Fierens
ICML
2010
IEEE
13 years 8 months ago
Feature Selection as a One-Player Game
This paper formalizes Feature Selection as a Reinforcement Learning problem, leading to a provably optimal though intractable selection policy. As a second contribution, this pape...
Romaric Gaudel, Michèle Sebag