Sciweavers

2623 search results - page 173 / 525
» Universal Learning Theory
Sort
View
138
Voted
IJAR
2008
82views more  IJAR 2008»
15 years 4 months ago
Probabilistic rough set approximations
This paper reviews probabilistic approaches to rough sets in granulation, approximation, and rule induction. The Shannon entropy function is used to quantitatively characterize pa...
Yiyu Yao
JAPLL
2008
76views more  JAPLL 2008»
15 years 4 months ago
Axiomatizing geometric constructions
In this survey paper, we present several results linking quantifier-free axiomatizations of various Euclidean and hyperbolic geometries in languages without relation symbols to ge...
Victor Pambuccian
IPL
2006
117views more  IPL 2006»
15 years 4 months ago
P systems without multiplicities of symbol-objects
In this paper we investigate P systems whose compartments contain sets of symbolobjects rather than multisets of objects, as it is common in membrane computing. If the number of m...
Artiom Alhazov
SOCO
2008
Springer
15 years 4 months ago
Strong non-standard completeness for fuzzy logics
In this paper we are going to introduce the notion of strong non-standard completeness (SNSC) for fuzzy logics. This notion naturally arises from the well known construction by ul...
Tommaso Flaminio
ECCV
2002
Springer
16 years 6 months ago
A Tale of Two Classifiers: SNoW vs. SVM in Visual Recognition
Numerous statistical learning methods have been developed for visual recognition tasks. Few attempts, however, have been made to address theoretical issues, and in particular, stud...
Ming-Hsuan Yang, Dan Roth, Narendra Ahuja