Results 231 to 240 of about 5,599,259 (245)
Some of the next articles are maybe not open access.
On the sets \(A+A\) and \(A-A\)
2015Zadanie pt. „Digitalizacja i udostępnienie w Cyfrowym Repozytorium Uniwersytetu Łódzkiego kolekcji czasopism naukowych wydawanych przez Uniwersytet Łódzki” nr 885/P-DUN/2014 zostało dofinansowane ze środków MNiSW w ramach działalności upowszechniającej naukę.
Jaskuła, Janusz, Lech, Jarosław
openaire +2 more sources
1997
We present two mutual encodings, respectively of the Calculus of Inductive Constructions in Zermelo-Fraenkel set theory and the opposite way. More precisely, we actually construct two families of encodings, relating the number of universes in the type theory with the number of inaccessible cardinals in the set theory.
openaire +1 more source
We present two mutual encodings, respectively of the Calculus of Inductive Constructions in Zermelo-Fraenkel set theory and the opposite way. More precisely, we actually construct two families of encodings, relating the number of universes in the type theory with the number of inaccessible cardinals in the set theory.
openaire +1 more source
From set unification to set constraints [PDF]
Intelligenza Artificiale: The international journal of the AIxIA, 2011 In this paper, we briefly summarize some of the most challenging issues that arise when allowing sets to be dealt with as first-class objects of a logic language, ranging from unification of well-founded and non-well-founded sets, to set constraint solving.
openaire +6 more sources
2016
Sparse representation has been widely used in visual tracking and achieves superior tracking results. However, most sparse representation models represent the target candidate as a linear combination of target templates and need to solve a sparse optimization problem. In this paper, we propose a novel set to set visual tracking (SSVT) method. Under the
Wencheng Zhu +3 more
openaire +2 more sources
Sparse representation has been widely used in visual tracking and achieves superior tracking results. However, most sparse representation models represent the target candidate as a linear combination of target templates and need to solve a sparse optimization problem. In this paper, we propose a novel set to set visual tracking (SSVT) method. Under the
Wencheng Zhu +3 more
openaire +2 more sources
Constructive sets in computable sets
Journal of Computer Science and Technology, 1997zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
2004
We study the ordered set of rough sets determined by relations which are not necessarily reflexive, symmetric, or transitive. We show that for tolerances and transitive binary relations the set of rough sets is not necessarily even a semilattice. We also prove that the set of rough sets determined by a symmetric and transitive binary relation forms a ...
openaire +1 more source
We study the ordered set of rough sets determined by relations which are not necessarily reflexive, symmetric, or transitive. We show that for tolerances and transitive binary relations the set of rough sets is not necessarily even a semilattice. We also prove that the set of rough sets determined by a symmetric and transitive binary relation forms a ...
openaire +1 more source
ON THE CHARACTERIZATION OF INPUT SETS AS OUTPUT SETS
Fundamenta Informaticae, 1994In [1] it is proved that for real closed fields the output sets (of computing machines) are also input sets. In this work it is shown that the converse holds for a class of ordered fields. It follows that the uncountable subfields of R are real closed if and only if their output sets are also input sets.
openaire +3 more sources
On Sets Reducible to Sparse Sets∗
Proceeding Structure in Complexity Theory, 1987Ronald V. Book, Ker-I Ko
openaire +2 more sources