Yael Dekel

According to our database, Yael Dekel authored at least 6 papers between 2007 and 2019.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2019

Machine Learning at Microsoft with ML .NET.

Zeeshan Ahmed, Saeed Amizadeh, Mikhail Bilenko, Rogan Carr, Wei-Sheng Chin, Yael Dekel, Xavier Dupré, Vadim Eksarevskiy, Eric Erhardt, Costin Eseanu, Senja Filipi, Tom Finley, Abhishek Goswami, Monte Hoover, Scott Inglis, Matteo Interlandi, Shon Katzenberger, Najeeb Kazmi, Gleb Krivosheev, Pete Luferenko, Ivan Matantsev, Sergiy Matusevych, Shahab Moradi, Gani Nazirov, Justin Ormont, Gal Oshri, Artidoro Pagnoni, Jignesh Parmar, Prabhat Roy, Sarthak Shah, Mohammad Zeeshan Siddiqui, Markus Weimer, Shauheen Zahirazami, Yiwen Zhu

CoRR, 2019

Machine Learning at Microsoft with ML.NET.

Zeeshan Ahmed, Saeed Amizadeh, Mikhail Bilenko, Rogan Carr, Wei-Sheng Chin, Yael Dekel, Xavier Dupré, Vadim Eksarevskiy, Senja Filipi, Tom Finley, Abhishek Goswami, Monte Hoover, Scott Inglis, Matteo Interlandi, Najeeb Kazmi, Gleb Krivosheev, Pete Luferenko, Ivan Matantsev, Sergiy Matusevych, Shahab Moradi, Gani Nazirov, Justin Ormont, Gal Oshri, Artidoro Pagnoni, Jignesh Parmar, Prabhat Roy, Mohammad Zeeshan Siddiqui, Markus Weimer, Shauheen Zahirazami, Yiwen Zhu

Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, 2019

2017

Competing first passage percolation on random regular graphs.

Tonci Antunovic, Yael Dekel, Elchanan Mossel, Yuval Peres

Random Struct. Algorithms, 2017

2011

On the geometry of random graphs (נוספו שער ותקציר בעברית: על הגיאומטריה של גרפים מקריים.).

Yael Dekel

PhD thesis, 2011

Finding Hidden Cliques in Linear Time with High Probability.

Yael Dekel, Ori Gurel-Gurevich, Yuval Peres

Proceedings of the Eighth Workshop on Analytic Algorithmics and Combinatorics, 2011

2007

Eigenvectors of Random Graphs: Nodal Domains.

Yael Dekel, James R. Lee, Nathan Linial

Proceedings of the Approximation, 2007