Graph

Results: 12817



#Item
251

Spectral Graph Analysis of Quasi-Cyclic Codes

Add to Reading List

Source URL: math.nd.edu

- Date: 2016-09-06 14:51:49
    252

    Random Projections, Graph Sparsification, and Differential Privacy Jalaj Upadhyay Center for Applied Cryptographic Research University of Waterloo

    Add to Reading List

    Source URL: www.iacr.org

    - Date: 2013-12-03 23:28:30
      253

      Relationship between the Reprogramming Determinants of Boolean Networks and their Interaction Graph Hugues Mandon, Stefan Haar, Lo¨ıc Paulev´e To cite this version: Hugues Mandon, Stefan Haar, Lo¨ıc Paulev´e. Relat

      Add to Reading List

      Source URL: www.lsv.ens-cachan.fr

      - Date: 2016-09-24 12:34:25
        254

        Graph Connectivity Measures for Unsupervised Word Sense Disambiguation Roberto Navigli Dipartimento di Informatica Universit`a di Roma “La Sapienza” Abstract

        Add to Reading List

        Source URL: homepages.inf.ed.ac.uk

        - Date: 2006-11-14 04:49:55
          255

          Semi-Supervised Convolution Graph Kernels for Relation Extraction (Intern work with NEC Labs) Xia Ning CS&E, University of Minnesota, Twin Cities

          Add to Reading List

          Source URL: www.cs.cmu.edu

          - Date: 2011-05-09 15:16:47
            256

            Stanford University — Graph Partitioning and Expanders Luca Trevisan Handout 2 April 30, 2013

            Add to Reading List

            Source URL: theory.stanford.edu

            - Date: 2013-05-08 22:51:52
              257

              Neural networks Conditional random fields - factor graph K (L+1) K (y,

              Add to Reading List

              Source URL: dl.dropboxusercontent.com

                258

                Prague, Doc-CourseOVERVIEW Graph parameters and graph polynomials: Definability and complexity

                Add to Reading List

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

                - Date: 2014-10-15 19:03:28
                  259

                  The random planar graph process Stefanie Gerke ∗ Dirk Schlatter

                  Add to Reading List

                  Source URL: www-m9.ma.tum.de

                  - Date: 2015-10-27 10:47:38
                    260

                    Weighted Graph Clustering with Non-Uniform Uncertainties 7. Proofs 7.1. Proof of Theorem 1 Observe that Y ⇤ 2 Spsd ⇢ Snuclear , so it suffices to prove the theorem assuming S = Snuclear in (3).

                    Add to Reading List

                    Source URL: jmlr.org

                    - Date: 2015-02-01 17:03:26
                      UPDATE