Connected component

Results: 187



#Item
1Properness defects of projections and computation of one point in each connected component of a real algebraic set Mohab Safey El Din, LIP6, Universit´e Paris 6, France ´

Properness defects of projections and computation of one point in each connected component of a real algebraic set Mohab Safey El Din, LIP6, Universit´e Paris 6, France ´

Add to Reading List

Source URL: cs.uwaterloo.ca

Language: English - Date: 2015-10-14 23:45:42
    2EVERY CONNECTED SUM OF LENS SPACES IS A REAL COMPONENT OF A UNIRULED ALGEBRAIC VARIETY ´ ERIC ´ JOHANNES HUISMAN AND FRED MANGOLTE

    EVERY CONNECTED SUM OF LENS SPACES IS A REAL COMPONENT OF A UNIRULED ALGEBRAIC VARIETY ´ ERIC ´ JOHANNES HUISMAN AND FRED MANGOLTE

    Add to Reading List

    Source URL: math.univ-angers.fr

    - Date: 2010-10-22 10:32:45
      3Properness defects of projections and computation of one point in each connected component of a real algebraic set Mohab Safey El Din, LIP6, Universit´e Paris 6, France ´

      Properness defects of projections and computation of one point in each connected component of a real algebraic set Mohab Safey El Din, LIP6, Universit´e Paris 6, France ´

      Add to Reading List

      Source URL: www.csd.uwo.ca

      - Date: 2003-05-02 07:43:34
        4Semi-automatic point cloud segmentation Sergey Alexandrov PCL Tutorial – IAS 2014 Semi-automatic segmentation

        Semi-automatic point cloud segmentation Sergey Alexandrov PCL Tutorial – IAS 2014 Semi-automatic segmentation

        Add to Reading List

        Source URL: www.pointclouds.org

        Language: English - Date: 2014-07-21 10:46:30
        5Network Analysis and Modeling Lectures 1 and 2 Prof. Aaron Clauset 1

        Network Analysis and Modeling Lectures 1 and 2 Prof. Aaron Clauset 1

        Add to Reading List

        Source URL: tuvalu.santafe.edu

        Language: English - Date: 2013-11-23 11:09:17
        6Graph Expansion and Communication Costs of Fast Matrix Multiplication Grey Ballard ∗ James Demmel †

        Graph Expansion and Communication Costs of Fast Matrix Multiplication Grey Ballard ∗ James Demmel †

        Add to Reading List

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

        Language: English - Date: 2014-11-26 08:32:33
        7BR-Index: An Indexing Structure for Subgraph Matching in Large Dynamic Graphs Jiong Yang and Wei Jin EECS Department Case Western Reserve University

        BR-Index: An Indexing Structure for Subgraph Matching in Large Dynamic Graphs Jiong Yang and Wei Jin EECS Department Case Western Reserve University

        Add to Reading List

        Source URL: ssdbm2011.ssdbm.org

        Language: English - Date: 2011-09-01 19:29:56
        8Lecture 1 Spectral Graph Theory Introduction September 2, 2009

        Lecture 1 Spectral Graph Theory Introduction September 2, 2009

        Add to Reading List

        Source URL: www.cs.yale.edu

        Language: English - Date: 2012-08-24 09:50:05
        9Network Analysis and Modeling CSCI 5352, Fall 2013 Prof. Aaron Clauset Problem Set 4, duepts total) Using the configuration model, investigate the set of random graphs in which

        Network Analysis and Modeling CSCI 5352, Fall 2013 Prof. Aaron Clauset Problem Set 4, duepts total) Using the configuration model, investigate the set of random graphs in which

        Add to Reading List

        Source URL: tuvalu.santafe.edu

        Language: English - Date: 2013-11-23 11:09:29
        10Algorithms and Data Structures Winter TermExercises for UnitProve that the implementation for the DFS-framework presented in the lecture correctly identifies the strongly connected components in a directe

        Algorithms and Data Structures Winter TermExercises for UnitProve that the implementation for the DFS-framework presented in the lecture correctly identifies the strongly connected components in a directe

        Add to Reading List

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

        Language: English - Date: 2016-03-14 05:26:21