Yury

Results: 296



#Item
11An Optimization Framework for Weighting Implicit Relevance Labels for Personalized Web Search Yury Ustinovskiy Gleb Gusev

An Optimization Framework for Weighting Implicit Relevance Labels for Personalized Web Search Yury Ustinovskiy Gleb Gusev

Add to Reading List

Source URL: www.www2015.it

- Date: 2015-05-15 11:17:01
    12An Optimization Framework for Remapping and Reweighting Noisy Relevance Labels Yury Ustinovskiy, Valentina Fedorova, Gleb Gusev, Pavel Serdyukov Yandex Leo Tolstoy st. 16, Moscow, Russia

    An Optimization Framework for Remapping and Reweighting Noisy Relevance Labels Yury Ustinovskiy, Valentina Fedorova, Gleb Gusev, Pavel Serdyukov Yandex Leo Tolstoy st. 16, Moscow, Russia

    Add to Reading List

    Source URL: www.researchgate.net

      13A Dirac-type theorem for Hamilton Berge cycles in random hypergraphs Dennis Clemens a,1 , Julia Ehrenm¨ uller a,2 , and Yury Person b,3,4 a

      A Dirac-type theorem for Hamilton Berge cycles in random hypergraphs Dennis Clemens a,1 , Julia Ehrenm¨ uller a,2 , and Yury Person b,3,4 a

      Add to Reading List

      Source URL: discretemath.upc.edu

      - Date: 2016-07-10 20:00:19
        14ON ALMOST OPTIMAL UNIVERSAL HYPERGRAPHS  arXiv:1509.03983v3 [math.CO] 13 May 2016 SAMUEL HETTERICH, OLAF PARCZYK AND YURY PERSON Abstract. A hypergraph H is called universal for a family F of hypergraphs, if it contains

        ON ALMOST OPTIMAL UNIVERSAL HYPERGRAPHS arXiv:1509.03983v3 [math.CO] 13 May 2016 SAMUEL HETTERICH, OLAF PARCZYK AND YURY PERSON Abstract. A hypergraph H is called universal for a family F of hypergraphs, if it contains

        Add to Reading List

        Source URL: arxiv.org

        - Date: 2016-05-16 02:35:48
          15DEVELOPING A POLYSYNTHETIC LANGUAGE CORPUS: PROBLEMS AND SOLUTIONS Timofey Arkhangelskiy & Yury Lander

          DEVELOPING A POLYSYNTHETIC LANGUAGE CORPUS: PROBLEMS AND SOLUTIONS Timofey Arkhangelskiy & Yury Lander

          Add to Reading List

          Source URL: www.dialog-21.ru

          - Date: 2016-06-16 07:36:13
            16Image source: Yury V. Zaytsev  NEST: The Neural Simulation Tool PARTNERS

            Image source: Yury V. Zaytsev NEST: The Neural Simulation Tool PARTNERS

            Add to Reading List

            Source URL: www.nest-simulator.org

            Language: English - Date: 2016-01-04 09:55:18
            17Interview with GM Yuri Shulman July 24, 2010 by Aditya Kumar The Fremont Chess Club has hosted many reputed players in the past, notably GM Gregory Kaidanov, IM Emory Tate, and IM Andranik Matikozyan. During the past wee

            Interview with GM Yuri Shulman July 24, 2010 by Aditya Kumar The Fremont Chess Club has hosted many reputed players in the past, notably GM Gregory Kaidanov, IM Emory Tate, and IM Andranik Matikozyan. During the past wee

            Add to Reading List

            Source URL: www.calchess.org

            Language: English - Date: 2010-08-14 22:17:36
            18Tesseract: Reconciling Guest I/O and Hypervisor Swapping in a VM Kapil Arya ∗ Yury Baskakov

            Tesseract: Reconciling Guest I/O and Hypervisor Swapping in a VM Kapil Arya ∗ Yury Baskakov

            Add to Reading List

            Source URL: www.ccs.neu.edu

            Language: English - Date: 2014-02-06 00:42:35
            19Message from Yury Fedotov, Director-General of the United Nations (Vienna) delivered by Simonetta Di Pippo, Director of the UN Office for Outer Space Affairs (UNOOSA)  Excellencies,

            Message from Yury Fedotov, Director-General of the United Nations (Vienna) delivered by Simonetta Di Pippo, Director of the UN Office for Outer Space Affairs (UNOOSA) Excellencies,

            Add to Reading List

            Source URL: www.unscear.org

            Language: English - Date: 2016-06-23 07:35:46
            20AN IMPROVED ERROR TERM FOR MINIMUM H-DECOMPOSITIONS OF GRAPHS ¨ PETER ALLEN*, JULIA BOTTCHER*, AND YURY PERSON† Abstract. We consider partitions of the edge set of a graph G

            AN IMPROVED ERROR TERM FOR MINIMUM H-DECOMPOSITIONS OF GRAPHS ¨ PETER ALLEN*, JULIA BOTTCHER*, AND YURY PERSON† Abstract. We consider partitions of the edge set of a graph G

            Add to Reading List

            Source URL: www.math.uni-frankfurt.de

            Language: English - Date: 2013-08-01 11:11:39