11![An 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](https://www.pdfsearch.io/img/2a21e85c661c1d8696bf633a7c2914a5.jpg) | Add to Reading ListSource URL: www.www2015.it- Date: 2015-05-15 11:17:01
|
---|
12![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 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](https://www.pdfsearch.io/img/49abc9f78cba8d582386fe1d0a2636da.jpg) | Add to Reading ListSource URL: www.researchgate.net |
---|
13![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 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](https://www.pdfsearch.io/img/ffc69af34ee53ea606094ffb399dd0ac.jpg) | Add to Reading ListSource URL: discretemath.upc.edu- Date: 2016-07-10 20:00:19
|
---|
14![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 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](https://www.pdfsearch.io/img/ad0725d7c2d35401ae9ed6c04d2f3758.jpg) | Add to Reading ListSource URL: arxiv.org- Date: 2016-05-16 02:35:48
|
---|
15![DEVELOPING A POLYSYNTHETIC LANGUAGE CORPUS: PROBLEMS AND SOLUTIONS Timofey Arkhangelskiy & Yury Lander DEVELOPING A POLYSYNTHETIC LANGUAGE CORPUS: PROBLEMS AND SOLUTIONS Timofey Arkhangelskiy & Yury Lander](https://www.pdfsearch.io/img/fb68c57f264c7db459f66bad9f8fc3f7.jpg) | Add to Reading ListSource URL: www.dialog-21.ru- Date: 2016-06-16 07:36:13
|
---|
16![Image source: Yury V. Zaytsev NEST: The Neural Simulation Tool
PARTNERS Image source: Yury V. Zaytsev NEST: The Neural Simulation Tool
PARTNERS](https://www.pdfsearch.io/img/28b9ace1aca4989277041b1bf37d3b44.jpg) | Add to Reading ListSource URL: www.nest-simulator.orgLanguage: English - Date: 2016-01-04 09:55:18
|
---|
17![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 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](https://www.pdfsearch.io/img/efd378a749bb082b87f519b5c25b1df3.jpg) | Add to Reading ListSource URL: www.calchess.orgLanguage: English - Date: 2010-08-14 22:17:36
|
---|
18![Tesseract: 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](https://www.pdfsearch.io/img/76a255193e6b3cfe6b8029dfc0611ebe.jpg) | Add to Reading ListSource URL: www.ccs.neu.eduLanguage: English - Date: 2014-02-06 00:42:35
|
---|
19![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, 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,](https://www.pdfsearch.io/img/16559c5d9dfb08afa83a412fb8b472a4.jpg) | Add to Reading ListSource URL: www.unscear.orgLanguage: English - Date: 2016-06-23 07:35:46
|
---|
20![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 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](https://www.pdfsearch.io/img/c8eb107a5de67e83c803981743e65034.jpg) | Add to Reading ListSource URL: www.math.uni-frankfurt.deLanguage: English - Date: 2013-08-01 11:11:39
|
---|