Oxford Index Search Results

You are looking at 1-20 of 190 items for:

disjoint x clear all

Refine by subject

 

Refine by type

Refine by product

 

disjoint

Overview page. Subjects: Computing.

A term applied to two sets that have no element in common, i.e. such that the intersection of the sets results in the empty set. A number of sets are said to be mutually disjoint if each...

See overview in Oxford Index

disjoint

Simon Blackburn.

in The Oxford Dictionary of Philosophy

January 2016; p ublished online March 2016 .

Reference Entry. Subjects: Philosophy. 12 words.

Two sets are disjoint if they have no member in common.

disjoint

Simon Blackburn.

in The Oxford Dictionary of Philosophy

January 2008; p ublished online January 2008 .

Reference Entry. Subjects: Philosophy. 12 words.

Two sets are disjoint if they have no member in common.

disjoint

Christopher Clapham and James Nicholson.

in The Concise Oxford Dictionary of Mathematics

January 2009; p ublished online January 2009 .

Reference Entry. Subjects: Pure Mathematics. 18 words.

Sets A and B are disjoint if they have no elements in common; that is, if AB=Ø.

disjoint

Christopher Clapham and James Nicholson.

in The Concise Oxford Dictionary of Mathematics

January 2014; p ublished online September 2014 .

Reference Entry. Subjects: Pure Mathematics. 21 words.

Sets A and B are disjoint if they have no elements in common; that is, if AB=Ø....

disjoint

Overview page. Subjects: Computing.

A term applied to two sets that have no element in common, i.e. such that the intersection of the sets results in the empty set. A number of sets are said to be mutually disjoint if each...

See overview in Oxford Index

pairwise disjoint

Christopher Clapham and James Nicholson.

in The Concise Oxford Dictionary of Mathematics

January 2014; p ublished online September 2014 .

Reference Entry. Subjects: Pure Mathematics. 44 words.

Sets A 1, A 2,…, A n are said to be pairwise disjoint if A i A null...

almost disjoint

Christopher Clapham and James Nicholson.

in The Concise Oxford Dictionary of Mathematics

January 2014; p ublished online September 2014 .

Reference Entry. Subjects: Pure Mathematics. 36 words.

Two sets are almost disjoint if their intersection is finite (or small in some other defined sense). A collection of subsets is said to be almost disjoint if they are ...

pairwise disjoint

Christopher Clapham and James Nicholson.

in The Concise Oxford Dictionary of Mathematics

January 2009; p ublished online January 2009 .

Reference Entry. Subjects: Pure Mathematics. 42 words.

Sets A 1, A 2,…, A n are said to be pairwise disjoint if A i A

null...

pairwise disjoint

Overview page. Subjects: Mathematics.

Sets A 1, A 2,…, A n are said to be pairwise disjoint if A i A null...

See overview in Oxford Index

disjoint

Edited by Andrew Butterfield, Gerard Ekembe Ngondi and Anne Kerr.

in A Dictionary of Computer Science

January 2016; p ublished online January 2016 .

Reference Entry. Subjects: Computing. 43 words.

A term applied to two sets that have no element in common, i.e. such that the *intersection of the sets results in the ...

disjoint

John Daintith and Edmund Wright.

in A Dictionary of Computing

January 2008; p ublished online January 2008 .

Reference Entry. Subjects: Computing. 41 words.

A term applied to two sets that have no element in common, i.e. such that the *intersection of the

Exploiting disjointness axioms to improve semantic similarity measures

João D. Ferreira, Janna Hastings and Francisco M. Couto.

in Bioinformatics

November 2013; p ublished online September 2013 .

Journal Article. Subjects: Bioinformatics and Computational Biology. 5021 words.

Motivation: Representing domain knowledge in biology has traditionally been accomplished by creating simple hierarchies of classes with textual annotations. Recently,...

Go to »  abstract

mutually disjoint

Christopher Clapham and James Nicholson.

in The Concise Oxford Dictionary of Mathematics

January 2009; p ublished online January 2009 .

Reference Entry. Subjects: Pure Mathematics. 4 words.

mutually disjoint

Christopher Clapham and James Nicholson.

in The Concise Oxford Dictionary of Mathematics

January 2014; p ublished online September 2014 .

Reference Entry. Subjects: Pure Mathematics. 5 words.

disjoint adj

David Crystal.

in The Oxford Dictionary of Original Shakespearean Pronunciation

March 2016; p ublished online October 2016 .

Reference Entry. Subjects: Shakespeare Studies and Criticism. 6 words.

dɪsˈdʒǝɪnt

sp disioynt1, dis-ioynt1

Disjoint and reflexive prominent internal possessor constructions in Chimane

Sandy Ritchie.

in Prominent Internal Possessors

March 2019; p ublished online May 2019 .

Chapter. Subjects: Grammar, Syntax and Morphology; Linguistic Theories. 9720 words.

This chapter examines two types of prominent internal possessor constructions in Chimane (unclassified, Bolivia). In the first type, possessors internal to object arguments which are...

Go to »  abstract

Set-to-Set Disjoint Paths Routing in Hierarchical Cubic Networks

Antoine Bossard and Keiichi Kaneko.

in The Computer Journal

February 2014; p ublished online January 2013 .

Journal Article. Subjects: Computer Science. 0 words.

Due to its simplicity, the hypercube topology is popular as interconnection network of parallel systems. However, due to physical restrictions of the number of links per node, this topology...

Go to »  abstract

Node-to-Set Disjoint Paths in Biswapped Networks

Shan Ling and Weidong Chen.

in The Computer Journal

July 2014; p ublished online April 2013 .

Journal Article. Subjects: Computer Science. 0 words.

The node-to-set disjoint paths problem in a k-connected network Ω is defined as follows: given a node s and a set of k other nodes t 1, t 2, … , t null...

Go to »  abstract

Linear-Time Self-Stabilizing Algorithms for Disjoint Independent Sets

Stephen T. Hedetniemi, David P. Jacobs and K.E. Kennedy.

in The Computer Journal

November 2013; p ublished online September 2012 .

Journal Article. Subjects: Computer Science. 0 words.

A set S of nodes in a graph G = (V,E) is independent if no two nodes in S are adjacent. We present two types of self-stabilizing algorithms for finding disjoint independent sets R and B. In...

Go to »  abstract

PCA disjoint models for multiclass cancer analysis using gene expression data

S. Bicciato, A. Luchini and C. Di Bello.

in Bioinformatics

March 2003; p ublished online March 2003 .

Journal Article. Subjects: Bioinformatics and Computational Biology. 0 words.

Motivation: Microarray expression profiling appears particularly promising for a deeper understanding of cancer biology and to identify molecular signatures supporting the histological...

Go to »  abstract