Vertex

Results: 1582



#Item
21

Classroom Voting Questions: Precalculus Conic Sections 1. Find an equation of a parabola that has vertex at the origin, opens right, and passes through (9, −x

Add to Reading List

Source URL: mathquest.carroll.edu

Language: English - Date: 2018-05-02 10:39:51
    22

    Distance Oracles for Vertex-Labeled Graphs Danny Hermelin1 , Avivit Levy2 , Oren Weimann3 , and Raphael Yuster4 1 2

    Add to Reading List

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

    Language: English - Date: 2011-08-08 07:04:00
      23

      Latent Position Models Latent Position Estimation Pattern Recognition Empirical Results Estimating Latent Positions and Vertex

      Add to Reading List

      Source URL: www.ams.jhu.edu

      Language: English - Date: 2012-08-13 11:14:58
        24

        Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks Jukka Suomela Helsinki Institute for Information Technology HIIT University of Helsinki, Finland

        Add to Reading List

        Source URL: users.ics.aalto.fi

        Language: English - Date: 2013-12-09 16:38:32
          25

          Journal of Machine Learning ResearchSubmitted 7/16; Revised 8/16; Published 9/16 On the Consistency of the Likelihood Maximization Vertex Nomination Scheme: Bridging the Gap Between Maximum

          Add to Reading List

          Source URL: jmlr.org

          Language: English - Date: 2017-07-22 15:42:36
            26

            Vertex VXR-5000 Commercial Grade VHF Repeater

            Add to Reading List

            Source URL: www.repeater-builder.com

            Language: English - Date: 2014-10-09 14:10:28
              27

              Hardness of approximation for vertex-connectivity network design problems Guy Kortsarz∗ Robert Krauthgamer†

              Add to Reading List

              Source URL: crab.rutgers.edu

              Language: English - Date: 2010-10-08 18:13:37
                28

                CHMMC Team Round Problems November 22, 2015 Problemplayers take turns drawing lines that connect vertices of a regular n-gon. No player may draw a line that intersects another line at a point other than a vertex

                Add to Reading List

                Source URL: chmmc.caltech.edu

                Language: English - Date: 2015-11-29 17:53:13
                  29

                  Tight Approximation Bounds for Vertex Cover on Dense k-Partite Hypergraphs Marek Karpinski∗ Richard Schmied†

                  Add to Reading List

                  Source URL: theory.cs.uni-bonn.de

                  Language: English - Date: 2011-07-21 06:07:45
                    UPDATE