Constraint graph

Results: 103



#Item
1Modeling Exclusion with a Differentiable Factor Graph Constraint Jason Naradowsky 1 Sebastian Riedel 2 Abstract With the adoption of general neural network architectures, many researchers have opted to trade

Modeling Exclusion with a Differentiable Factor Graph Constraint Jason Naradowsky 1 Sebastian Riedel 2 Abstract With the adoption of general neural network architectures, many researchers have opted to trade

Add to Reading List

Source URL: deepstruct.github.io

Language: English - Date: 2017-08-09 03:07:44
    2Exact Solution of Graph Coloring Problems via Constraint Programming and Column Generation Stefano Gualandi, Federico Malucelli Dipartimento di Elettronica ed Informazione, Politecnico di Milano, Piazza L. da Vinci 32, M

    Exact Solution of Graph Coloring Problems via Constraint Programming and Column Generation Stefano Gualandi, Federico Malucelli Dipartimento di Elettronica ed Informazione, Politecnico di Milano, Piazza L. da Vinci 32, M

    Add to Reading List

    Source URL: www.optimization-online.org

    - Date: 2011-09-21 10:12:20
      3Locally-biased graph algorithms are algorithms that attempt to find local or small-scale structure in a typically large data graph. In some cases, this can be accomplished by adding some sort of locality constraint and c

      Locally-biased graph algorithms are algorithms that attempt to find local or small-scale structure in a typically large data graph. In some cases, this can be accomplished by adding some sort of locality constraint and c

      Add to Reading List

      Source URL: mmds-data.org

      - Date: 2016-06-23 15:50:48
        4Generating tractable CSPs by means of adjoint functors Jan Foniok joint work with Claude Tardif Fête of Combinatorics and Computer Science

        Generating tractable CSPs by means of adjoint functors Jan Foniok joint work with Claude Tardif Fête of Combinatorics and Computer Science

        Add to Reading List

        Source URL: www.ifor.math.ethz.ch

        Language: English - Date: 2008-11-18 08:48:31
        5Rectangular Decomposition of Binary Images Tom´ aˇs Suk, Cyril H¨oschl IV, and Jan Flusser Institute of Information Theory and Automation of the ASCR, Pod vod´ arenskou vˇeˇz´ı 4, Praha 8, Czech Republic

        Rectangular Decomposition of Binary Images Tom´ aˇs Suk, Cyril H¨oschl IV, and Jan Flusser Institute of Information Theory and Automation of the ASCR, Pod vod´ arenskou vˇeˇz´ı 4, Praha 8, Czech Republic

        Add to Reading List

        Source URL: library.utia.cas.cz

        Language: English - Date: 2012-08-15 08:16:50
        6Helmert’s and Bowie’s Geodetic Mapping Methods and Their Relation to Graph-Based SLAM Pratik Agarwal Wolfram Burgard

        Helmert’s and Bowie’s Geodetic Mapping Methods and Their Relation to Graph-Based SLAM Pratik Agarwal Wolfram Burgard

        Add to Reading List

        Source URL: www.lifelong-navigation.eu

        Language: English - Date: 2014-02-18 08:09:23
        7Locally-biased graph algorithms are algorithms that attempt to find local or small-scale structure in a typically large data graph. In some cases, this can be accomplished by adding some sort of locality constraint and c

        Locally-biased graph algorithms are algorithms that attempt to find local or small-scale structure in a typically large data graph. In some cases, this can be accomplished by adding some sort of locality constraint and c

        Add to Reading List

        Source URL: mmds-data.org

        Language: English - Date: 2016-06-23 15:50:48
        8sets-graph-msuc-opt.ipeps

        sets-graph-msuc-opt.ipeps

        Add to Reading List

        Source URL: tmancini.di.uniroma1.it

        Language: English - Date: 2008-12-16 11:04:43
        9Exercise 12: Weed Weak models Task 1: Hyper, hyper! Recall that a hypergraph is a graph where edges may comprise more than 2 nodes. The degree of a hyperedge is the number of nodes in it. Consider a hypergraph of maximum

        Exercise 12: Weed Weak models Task 1: Hyper, hyper! Recall that a hypergraph is a graph where edges may comprise more than 2 nodes. The degree of a hyperedge is the number of nodes in it. Consider a hypergraph of maximum

        Add to Reading List

        Source URL: resources.mpi-inf.mpg.de

        Language: English - Date: 2015-01-20 10:45:26
        10Popular Matching: A Constraint Programming Approach Danuta Sorina Chisca, Mohamed Siala, Gilles Simonin, Barry O’Sullivan Insight Centre for Data Analytics, University College Cork, Ireland ∗ {sorina.chisca, mohamed.

        Popular Matching: A Constraint Programming Approach Danuta Sorina Chisca, Mohamed Siala, Gilles Simonin, Barry O’Sullivan Insight Centre for Data Analytics, University College Cork, Ireland ∗ {sorina.chisca, mohamed.

        Add to Reading List

        Source URL: womencourage.acm.org

        Language: English