Pairwise

Results: 251



#Item
11

Pairwise Reachability Analysis for Higher Order Concurrent Programs by Higher-Order Model Checking Kazuhide Yasukata, Naoki Kobayashi and Kazutaka Matsuda The University of Tokyo

Add to Reading List

Source URL: www-kb.is.s.u-tokyo.ac.jp

Language: English - Date: 2015-10-01 02:54:54
    12

    Sparse Flat Neighborhood Networks (SFNNs): Scalable Guaranteed Pairwise Bandwidth & Unit Latency Timothy I. Mattox, Henry G. Dietz, & William R. Dieter ECE Department, University of Kentucky 453 F. Paul Anderson Tower, L

    Add to Reading List

    Source URL: aggregate.org

    Language: English - Date: 2005-02-02 13:54:45
      13

      The Pairwise Piecewise-Linear Embedding for Efficient Non-Linear Classification Ofir Pele, Ben Taskar ofirpele, University of Pennsylvania, Department of Computer and Information Science, Philadelphia

      Add to Reading List

      Source URL: proceedings.mlr.press

      Language: English - Date: 2018-07-16 03:38:07
        14

        RANDOM WALKS WITH -WISE INDEPENDENT INCREMENTS ITAI BENJAMINI, GADY KOZMA, AND DAN ROMIK A BSTRACT . We construct examples of a random walk with pairwise indeand a pendent steps which is almost-surely bounded, and for an

        Add to Reading List

        Source URL: www.math.ucdavis.edu

        - Date: 2014-02-10 20:43:58
          15

          Approximate Ranking from Pairwise Comparisons Reinhard Heckel∗ Max Simchowitz? Kannan Ramchandran?

          Add to Reading List

          Source URL: www.reinhardheckel.com

          - Date: 2018-02-27 17:09:09
            16

            Active Ranking from Pairwise Comparisons and when Parametric Assumptions Don’t Help Reinhard Heckel? Nihar B. Shah?

            Add to Reading List

            Source URL: www.reinhardheckel.com

            - Date: 2018-02-27 19:07:52
              17

              Which Point Configurations are Determined by the Distribution of their Pairwise Distances? Mireille Boutin and Gregor Kemper March 14, 2006 Abstract In a previous paper we showed that, for any n ≥ m + 2, most sets of n

              Add to Reading List

              Source URL: graphics.stanford.edu

              - Date: 2008-10-16 22:20:12
                18

                Neural networks Training CRFs - pairwise log-factor gradient P MACHINE LEARNING

                Add to Reading List

                Source URL: dl.dropboxusercontent.com

                  19

                  The Pairwise Piecewise-Linear Embedding for Efficient Non-Linear Classification Ofir Pele, Ben Taskar ofirpele, University of Pennsylvania, Department of Computer and Information Science, Philadelphia

                  Add to Reading List

                  Source URL: jmlr.csail.mit.edu

                  - Date: 2013-08-14 01:36:44
                    20

                    p. 1 IEEE conference on Computer Vision and Pattern Recognition (CVPR), Columbus, Ohio, 2014 Submodularization for Binary Pairwise Energies Lena Gorelick Yuri Boykov Olga Veksler

                    Add to Reading List

                    Source URL: www.csd.uwo.ca

                    - Date: 2014-05-02 11:25:52
                      UPDATE