Disjoint sets

Results: 23



#Item
1Bachelor / Master Thesis  Hamilton cycles in Kneser graphs Description. The Kneser graph K(n, k) has as vertices all k-element subsets of an n-element set, where any two disjoint sets are connected by an edge. Note that

Bachelor / Master Thesis Hamilton cycles in Kneser graphs Description. The Kneser graph K(n, k) has as vertices all k-element subsets of an n-element set, where any two disjoint sets are connected by an edge. Note that

Add to Reading List

Source URL: page.math.tu-berlin.de

Language: English
2Optimized Union of Non-disjoint Distributed Data Sets Itay Dar Tova Milo  ∗

Optimized Union of Non-disjoint Distributed Data Sets Itay Dar Tova Milo ∗

Add to Reading List

Source URL: www.cs.tau.ac.il

Language: English - Date: 2008-09-25 05:48:21
3Algorithms and Data Structures Winter TermExercises for Unit 4 1. Consider the problem Disjointness of testing whether two sets A = {a1 , . . . , an } and B = {b1 , . . . , bn } of real numbers are disjoint.

Algorithms and Data Structures Winter TermExercises for Unit 4 1. Consider the problem Disjointness of testing whether two sets A = {a1 , . . . , an } and B = {b1 , . . . , bn } of real numbers are disjoint.

Add to Reading List

Source URL: www-tcs.cs.uni-sb.de

Language: English - Date: 2016-03-01 06:02:55
4Optimized Union of Non-disjoint Distributed Data Sets Itay Dar Tova Milo  ∗

Optimized Union of Non-disjoint Distributed Data Sets Itay Dar Tova Milo ∗

Add to Reading List

Source URL: www.mancoosi.org

Language: English - Date: 2012-12-16 04:54:55
5Ramsey-type constructions for arrangements of segments Jan Kynˇcl Charles University, Prague  Arrangement of segments:

Ramsey-type constructions for arrangements of segments Jan Kynˇcl Charles University, Prague Arrangement of segments:

Add to Reading List

Source URL: kam.mff.cuni.cz

Language: English - Date: 2008-06-04 17:03:58
6Scalable, Continuous Tracking of Tag Co-Occurrences between Short Sets using (Almost) Disjoint Tag Partitions∗ Foteini Alvanaki Sebastian Michel

Scalable, Continuous Tracking of Tag Co-Occurrences between Short Sets using (Almost) Disjoint Tag Partitions∗ Foteini Alvanaki Sebastian Michel

Add to Reading List

Source URL: qid3.mmci.uni-saarland.de

Language: English - Date: 2013-06-23 17:39:03
    7INVERSE BOUNDARY VALUE PROBLEM BY MEASURING DIRICHLET DATA AND NEUMANN DATA ON DISJOINT SETS OLEG YU. IMANUVILOV, GUNTHER UHLMANN, AND MASAHIRO YAMAMOTO Abstract. We discuss the inverse boundary value problem of determin

    INVERSE BOUNDARY VALUE PROBLEM BY MEASURING DIRICHLET DATA AND NEUMANN DATA ON DISJOINT SETS OLEG YU. IMANUVILOV, GUNTHER UHLMANN, AND MASAHIRO YAMAMOTO Abstract. We discuss the inverse boundary value problem of determin

    Add to Reading List

    Source URL: www.math.washington.edu

    Language: English - Date: 2011-06-26 00:11:06
      8Univalent Foundation and Constructive Mathematics Thierry Coquand Oberwolfach, November 21, 2014  Univalent Foundation and Constructive Mathematics

      Univalent Foundation and Constructive Mathematics Thierry Coquand Oberwolfach, November 21, 2014 Univalent Foundation and Constructive Mathematics

      Add to Reading List

      Source URL: www.cse.chalmers.se

      Language: English - Date: 2015-02-28 14:56:51
      9Encapsulation theory: radial encapsulation. Edmund Kirwan* www.EdmundKirwan.com Abstract This paper introduces the concept of radial encapsulation, whereby dependencies are constrained to act 

      Encapsulation theory: radial encapsulation. Edmund Kirwan* www.EdmundKirwan.com Abstract This paper introduces the concept of radial encapsulation, whereby dependencies are constrained to act 

      Add to Reading List

      Source URL: edmundkirwan.com

      Language: English - Date: 2013-01-02 07:13:07
      10Page 1  Encapsulation theory: L3 potential coupling. Edmund Kirwan www.EdmundKirwan.com * Abstract

      Page 1 Encapsulation theory: L3 potential coupling. Edmund Kirwan www.EdmundKirwan.com * Abstract

      Add to Reading List

      Source URL: edmundkirwan.com

      Language: English - Date: 2012-05-22 14:20:19