Results 261 to 270 of about 105,023,630 (305)
Human brains construct individualized global rankings from identical few-shot learning input. [PDF]
PLoS BiolLiu D, Wang M, Luo H.
europepmc +1 more source
A polymer physics model of the interphase cell nucleus for radiobiological simulations. [PDF]
Sci RepZhao M, Huang G, Xu Z, Huang X, Liang Y.
europepmc +1 more source
Overpassivization Revisited: Disentangling Syntax and Semantics in Causes of Errors. [PDF]
J Psycholinguist ResKang C, Oh E.
europepmc +1 more source
Homophily in friendship choice during an early life transition: A cohort network dynamic approach.
Evol Hum BehavKempnich M +3 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Aggregation of T-transitive relations
International Journal of Intelligent Systems, 2003This article studies the aggregation of transitive fuzzy relations. We first find operators that preserve transitivity and then extend the results to aggregating operators. As special cases, means and some kind of suitable ordered weighted averaging (OWAs) are used to aggregate transitive fuzzy relations with respect to an Archimedean t-norm.
Jacas Moral, Juan +1 more
openaire +2 more sources
On computing the transitive closure of a state transition relation
Proceedings of the 30th international on Design automation conference - DAC '93, 1993We describe a new, recursive-descent procedure for the computation of the transitive closure of a transition relation. This procedure is the classic binary matrix procedure of [1], adapted to a BDD data structure. We demonstrate its efficacy when compared to standard iterative methods.
Yusuke Matsunaga +2 more
openaire +2 more sources
Transitive closure and betweenness relations
Fuzzy Sets and Systems, 2001Peer ...
Boixader Ibáñez, Dionís +2 more
openaire +4 more sources
On computing the transitive closure of a relation
Acta Informatica, 1977An algorithm is presented for computing the transitive closure of an arbitrary relation which is based upon Tarjan's algorithm [7] for finding the strongly connected components of a directed graph. A new formulation, justifying a somewhat simplified statement of the latter, characterises weaker restrictions on the form of the graph traversal than ...
J. Eve, Reino Kurki-Suonio
openaire +2 more sources
Transitivity in semantic relation learning
Proceedings of the 6th International Conference on Natural Language Processing and Knowledge Engineering(NLPKE-2010), 2010Text understanding models exploit semantic networks of words as basic components. Automatically enriching and expanding these resources is then an important challenge for NLP. Existing models for enriching semantic resources based on lexical-syntactic patterns make little use of structural properties of target semantic relations.
Francesca Fallucchi +1 more
openaire +2 more sources
‘Transitivity’ of Consequence Relations
2015A binary relation R on a set S is transitive iff for all a, b, c ∈ S, if aRb and bRc, then aRc. This almost never applies to the relations logicians tend to think of as consequence relations; where such relations are relations on a set at all, they are rarely transitive.
openaire +1 more source